Sciweavers

16 search results - page 1 / 4
» On the domination number of Hamiltonian graphs with minimum ...
Sort
View
APPML
2008
92views more  APPML 2008»
14 years 10 months ago
On the domination number of Hamiltonian graphs with minimum degree six
Let G = (V, E) be a simple graph. A set D V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by (G), is the min...
Hua-Ming Xing, Johannes H. Hattingh, Andrew R. Plu...
GC
2008
Springer
14 years 10 months ago
Domination in Graphs of Minimum Degree at least Two and Large Girth
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
Christian Löwenstein, Dieter Rautenbach
COMBINATORICS
2006
156views more  COMBINATORICS 2006»
14 years 10 months ago
Total Domination and Matching Numbers in Claw-Free Graphs
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
Michael A. Henning, Anders Yeo
COMBINATORICS
1999
73views more  COMBINATORICS 1999»
14 years 9 months ago
A [k, k+1]-Factor Containing A Given Hamiltonian Cycle
We prove the following best possible result. Let k 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n 8k - 16 for even n and n 6k-13 for odd n...
Mao-cheng Cai, Yanjun Li, Mikio Kano
PROPERTYTESTING
2010
14 years 8 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon