A new bound on the domination number of graphs with minimum degree two.

Henning, Michael A.; Schiermeyer, Ingo; Yeo, Anders

The search session has expired. Please query the service again.

Displaying similar documents to “A new bound on the domination number of graphs with minimum degree two.”

A new upper bound on the total domination number of a graph.

Henning, Michael A., Yeo, Anders (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Independence number and disjoint theta graphs.

Fujita, Shinya, Magnant, Colton (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A characterization of graphs in which some minimum dominating set covers all the edges

Bert L. Hartnell, Douglas F. Rall (1995)

Czechoslovak Mathematical Journal

Similarity:

Graphs with disjoint dominating and paired-dominating sets

Justin Southey, Michael Henning (2010)

Open Mathematics

Similarity:

A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a paired-dominating set of a graph is a dominating set such that the subgraph induced by the dominating set contains a perfect matching. In this paper, we show that no minimum degree is sufficient to guarantee the existence of a disjoint dominating set and a paired-dominating set. However, we prove that the vertex set of every cubic graph can be partitioned...

A note on two circumference generalizations of Chvátal's Hamiltonicity condition

Ladislav Stacho (2002)

Mathematica Slovaca

Similarity:

Secure sets and their expansion in cubic graphs

Katarzyna Jesse-Józefczyk, Elżbieta Sidorowicz (2014)

Open Mathematics

Similarity:

Consider a graph whose vertices play the role of members of the opposing groups. The edge between two vertices means that these vertices may defend or attack each other. At one time, any attacker may attack only one vertex. Similarly, any defender fights for itself or helps exactly one of its neighbours. If we have a set of defenders that can repel any attack, then we say that the set is secure. Moreover, it is strong if it is also prepared for a raid of one additional foe who can strike...

Bridge and cycle degrees of vertices of graphs.

Chartrand, Gary, Saba, Farrokh, Wormald, Nicholas C. (1984)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Graph equations for line graphs and n-th distance graphs.

Simic, Slobodan K. (1983)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

The ramsey number for theta graph versus a clique of order three and four

M.S.A. Bataineh, M.M.M. Jaradat, M.S. Bateeha (2014)

Discussiones Mathematicae Graph Theory

Similarity:

For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph. In this paper, we consider the Ramsey numbers for theta-complete graphs. We determine r(θn,Km) for m = 2, 3, 4 and n > m. More specifically, we establish that r(θn,Km) = (n − 1)(m − 1) + 1 for m = 3, 4 and n > m