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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Domination, packing and excluded minors.”
A new upper bound on the total domination number of a graph.
On the graphs with maximum distance or -diameter
Wayne Goddard, Christine S. Swart, Henda C. Swart (2005)
Mathematica Slovaca
Similarity:
The Distance Roman Domination Numbers of Graphs
Hamideh Aram, Sepideh Norouzian, Seyed Mahmoud Sheikholeslami (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-distance Roman dominating function on G is a labeling f : V (G) → {0, 1, 2} such that for every vertex with label 0, there is a vertex with label 2 at distance at most k from each other. The weight of a k-distance Roman dominating function f is the value w(f) =∑v∈V f(v). The k-distance Roman domination number of a graph G, denoted by γkR (D), equals the minimum weight of a k-distance Roman dominating...
Distance in graphs
Roger C. Entringer, Douglas E. Jackson, D. A. Snyder (1976)
Czechoslovak Mathematical Journal
Similarity:
Elongation in a graph
Bohdan Zelinka (1982)
Mathematica Slovaca
Similarity: