SECURE DOMINATION IN TRANSFORMATION GRAPH Gxy+
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, we characterize graphs for which the secure domination number of the transformation graph Gxy+ is 1 or 2. Also we prove that for any connected graph G with at least 4 pendant vertices, the secure domination number is greater than or equal to the secure domination number of the transformation graph G−++. We also find a bound for the secure domination number of G−−+ when G is a tree.
Abstract
In this paper, we characterize graphs for which the secure domination number of the transformation graph Gxy+ is 1 or 2. Also we prove that for any connected graph G with at least 4 pendant vertices, the secure domination number is greater than or equal to the secure domination number of the transformation graph G−++. We also find a bound for the secure domination number of G−−+ when G is a tree.
참고문헌 (9)
- A. Aytac, "Vulnerability measures of transformation graph Gxy+", Int. J. of Foundations of Computer Sci, 26, pp.667~675 (2015)
- M. Behzad, "A criterion for the planarity of the total graph of a graph", Math. Proceedings of the Cambridge Philosophical Society, 63, pp.679~681 (1967), Cambridge University Press
- E. J. Cockayne, "Secure domination, weak roman domination and forbidden subgraphs", Bull. Inst. Combin. Appl, 39, pp.87~100 (2003)
- E. J. Cockayne, "Protection of a graph", Utilitas Mathematica, 67 (2005)
- T. W. Haynes, "Fundamentals of domination in graphs" (1998), marcel dekker, Inc.
- M. K. A. Jebitha, "Domination in transformation graph G+−+", Math. Combin, pp.58~73 (2012)
- R. A. L. Ugbinada, "Secure domination in the joins of graphs", Appl. Math. Sci, 8, pp.5203~5211 (2014)
- B. Wu, "Basic properties of total transformation graphs", J. Math. Study, 34, pp.109~116 (2001)
- B. Wu, "The transformation graph Gxyz when xyz=-++", Discrete Math, 296, pp.263~270 (2005)