Totally connected domination in graphs
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
In the last 50 years, Graph theory has seen an explosive growth due to interaction with areas like computer science, electrical and communication engineering, Operations Research etc. Perhaps the fastest growing area within graph theory is the study of domination, the reason being its many and varied applications in such fields as social sciences, communication networks, algorithm designs, computational complexity etc. There are several types of domination depending upon the nature of domination and the nature of the dominating set. In this paper, we introduce the totally connected domination in graphs in connected graphs, exact value for some standard graphs, bounds and some results are established
Abstract
In the last 50 years, Graph theory has seen an explosive growth due to interaction with areas like computer science, electrical and communication engineering, Operations Research etc. Perhaps the fastest growing area within graph theory is the study of domination, the reason being its many and varied applications in such fields as social sciences, communication networks, algorithm designs, computational complexity etc. There are several types of domination depending upon the nature of domination and the nature of the dominating set. In this paper, we introduce the totally connected domination in graphs in connected graphs, exact value for some standard graphs, bounds and some results are established
참고문헌 (14)
- J. Bondy, "Graph Theory with applications" (1976)
- K. D. Dharmalingam, "Studies in Graph Theorey-Equitable domination and bottleneck domination", 박사, pp.2006
- C. Godsil, "Algebraic graph theory, vol. 207 of Graduate Texts in Mathematics" (2001), Springer-Verlag
- F. Harary, "Graph theory" (1969), Addison-Wesley
- T. W. Haynes, "Fundamentals of domination in graphs" (1998), Marcel Dekker, Inc
- S. R. Jayaram, "Line domination in graphs", Graphs Combin, 3, pp.357~363 (1987)
- V.R. Kulli, "The non split domination number of a graph", Indian J. pure appl. Math, 27(6), pp.537542~ (1996)
- S. Mitchell, "Edge domination in trees", Congr. Numer, 19, pp.489~509 (1977)
- E. Sampathkumar, "The neighborhood number of a graph", Indian J. Pure and Appl. Math, 16(2), pp.126~132 (1985)
- E. Sampathkumar, "the connected domination number of a graph", J. Math. Phys. Sci, 13, pp.607~613 (1979)
- H. B. Walikar, "Recent developmentsin the theory of domination in graphs, Mehta Research instutute, Alahabad", MRI Lecture Notes in Math, 1 (1979)
- T. W. Haynes, "Fundamentals of domination in graphs" (1998), Marcel Dekker, Inc
- S. M. Hedetneimi, "Disjoint dominating sets in graphs", Proc. Int. Conf. on Disc.Math., IMI-IISc, Bangalore, pp.88~101 (2006)
- V. R. Kulli, "Further results on the neighborhood number of a graph", Indian J. Pure and Appl. Math, 23(8), pp.575~577 (1992)