Strong geodomination in graphs

• Autorzy: Rad N. J. , Mojdeh D. A.
• Języki publikacji: EN

Abstrakty

EN

A pair x, y of vertices in a nontrivial connected graph G is said to geodominate a vertex v of G if either v ∈ {x, y} or v lies in an x - y geodesic of G. A set S of vertices of G is a geodominating set if every vertex of G is geodominated by some pair of vertices of S. In this paper we study strong geodomination in a graph G.

Słowa kluczowe

EN

geodomination; k-geodomination; open geodomination

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2008
• Tom: Vol. 28, no. 3
• Strony: 279--285
• Opis fizyczny: Bibliogr. 7 poz.

Twórcy

autor

Rad N. J.

autor

Mojdeh D. A.

• Shahrood University of Technology, Department of Mathematics, Shahrood, Iran,

Bibliografia

• [1] G. Chartrand, F. Harary, P. Zhang, Geodetic sets in graphs, Discussiones Mathematicae Graph Theory 20 (2000), 129–138.
• [2] G. Chartrand, F. Harary, H.C. Swart, P. Zhang, Geodomination in graphs, Bull. ICA 31 (2001), 51–59.
• [3] D.A. Mojdeh, N. Jafari Rad, Connected geodomination in graphs, Journal of Discrete Mathematical Science and Cryptography 9 (2006), 177–186.
• [4] D.A. Mojdeh, N. Jafari Rad, k-perfect geodominating sets in graphs, Opuscula Mathematica 27 (2007), 51–57.
• [5] R. Muntean, P. Zhang, k-geodomination in graphs, Ars Combinatoria 63 (2002), 33–47.
• [6] R. Muntean, P. Zhang, On geodomination in graphs, Congressus Numerantium 143 (2000), 161–174.
• [7] D.B. West, Introduction to Graph Theory, 2nd edition, Prentice-Hall, USA, 2001.