Sciweavers

6 search results - page 1 / 2
» Domination in Graphs of Minimum Degree at least Two and Larg...
Sort
View
100
Voted
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
CPC
2007
112views more  CPC 2007»
14 years 10 months ago
Graphs with Large Girth Not Embeddable in the Sphere
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
Pierre Charbit, Stéphan Thomassé
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
98
Voted
JCO
2008
134views more  JCO 2008»
14 years 10 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
14 years 9 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller