On the Graph Parameters of Special Networks

Abstract:

Domination in graphs has become one of the major areas of graph theory with extensive applications in design and analysis of communication networks, computational complexity, and algorithm design. This paper mainly research on domination number and bondage number of the graph, especially, these parameters measure to some extent the robustness of an interconnection network with respect to link failures. By constructing a family of minimum dominating sets we compute the domination number and bondage number of the sun graph.

• Periodical: Applied Mechanics and Materials (Volumes 543-547)
• Pages: 2977-2980
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.543-547.2977
• Online since: March 2014
• Authors: Jian Xiang Cao*, Xin Feng, Zheng Tao Jiang
• Keywords: Bondage Number, Domination Number, Domination Set, Sun Graph

References

[1] T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, New York, (1998).

[2] T. W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, (1998).

[3] J. F. Fink, M. S. Jacobson, L. F. Kinch, J. Roberts, "The bondage number of a graph. Discrete Mathematics, 86(1990) 47-57.

DOI: 10.1016/0012-365x(90)90348-l

[4] J.A. Bondy and U.S.R. Murty, Graph Theory with Application, North-Hokkand, New York, (1976).

[5] John Clark , Derek Holton, Graph Theory, World Scientific Publishing , (1991).

[6] J.F. Fink et al., The bondage number of a graph, Discrete Math., 86 (1990) 47-57.