Sciweavers

3757 search results - page 119 / 752
» The overlap number of a graph
Sort
View
EJC
2008
15 years 6 months ago
3-bounded property in a triangle-free distance-regular graph
Let denote a distance-regular graph with classical parameters (D, b, , ) and D 3. Assume the intersection numbers a1 = 0 and a2 = 0. We show is 3-bounded in the sense of the ar...
Yeh-jong Pan, Chih-wen Weng
TCS
2008
15 years 6 months ago
An annotated bibliography on guaranteed graph searching
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In t...
Fedor V. Fomin, Dimitrios M. Thilikos
DAM
2000
78views more  DAM 2000»
15 years 6 months ago
Maximal cubic graphs with diameter 4
We prove that there is no cubic graph with diameter 4 on 40 vertices. This implies that the maximal number of vertices of a (3,4)-graph is 38. ? 2000 Elsevier Science B.V. All rig...
Dominique Buset
ENDM
2002
109views more  ENDM 2002»
15 years 6 months ago
Graph Operations and Zipfian Degree Distributions
The probability distribution on a set S = { 1, 2, . . . , n } defined by Pr(k) = 1/(Hnk), where Hn in the nth harmonic number, is commonly called a Zipfian distribution. In this no...
Walter W. Kirchherr
DM
2007
142views more  DM 2007»
15 years 6 months ago
Dominating direct products of graphs
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall