Sciweavers

10 search results - page 1 / 2
» endm 2002
Sort
View
ENDM
2002
91views more  ENDM 2002»
13 years 10 months ago
On minimally 3-connected graphs on a surface
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
Katsuhiro Ota
ENDM
2002
134views more  ENDM 2002»
13 years 10 months ago
Bounds on the signed domination number of a graph
Let G = (V, E) be a simple graph on vertex set V and define a function f : V {-1, 1}. The function f is a signed dominating function if for every vertex x V, the closed neighbor...
Ruth Haas, Thomas B. Wexler
ENDM
2002
109views more  ENDM 2002»
13 years 10 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
ENDM
2002
97views more  ENDM 2002»
13 years 10 months ago
Traceability in Small Claw-Free Graphs
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices an...
John M. Harris, Michael J. Mossinghoff