Roman bondage in graphs

@article{Rad2011RomanBI,
  title={Roman bondage in graphs},
  author={Nader Jafari Rad and Lutz Volkmann},
  journal={Discussiones Mathematicae Graph Theory},
  year={2011},
  volume={31},
  pages={763-773}
}
A Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman dominating function is the value f(V (G)) = 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

Roman bondage numbers of some graphs

Australasian J. Combinatorics • 2014
View 8 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Fundamentals of Domination in Graphs

T. W. Haynes, S. T. Hedetniemi, P. J. Slater
1998
View 1 Excerpt
Highly Influenced

Introduction to Graph Theory

D. B. West
(2nd edition) • 2001

Defend the Roman Empire

I. Stewart
Sci. Amer. 281 • 1999
View 1 Excerpt

Bondage

J. E. Dunbar, T. W. Haynes, U. Teschner, L. Volkmann
insensitivity, and reinforcement, in: T.W. Haynes, S.T. Hedetniemi, P.J. Slater (Eds.), Domination in Graphs: Advanced Topics • 1998
View 1 Excerpt

New results about the bondage number of a graph

Discrete Mathematics • 1997
View 1 Excerpt

Bounds on the bondage number of a graph

Discrete Mathematics • 1994
View 1 Excerpt

Similar Papers

Loading similar papers…