Abstract
A set D of vertices in a graph G is said to be a dominating set if every vertex in V − D is adjacent to some vertex in D. A subset D of V is a paired-dominating set of G, if D is a dominating set and the subgraph induced by the vertices of D contains a perfect matching. A set D of a vertices in a graph G = (V, E) is said to be a total dominating set of G if every vertex in V is adjacent to some vertex in D. The total bondage number b t (G) of G is the minimum number of edges whose removal enlarges the total domination number. In this paper we determine the domination number, paired-domination number, bondage number and the total bondage number for coronene torus using H-packing.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cao, J., Lin, W., Shi, M.: Total domination number of generalized Petersen graphs. Intell. Inf. Manag. pp. 15–18 (2009)
Cao, J., Shi, M., Wu, B.: Research on the total bondage number of a spectial network. In: Third International Joint Conference on Computational Science and Optimization, vol. 2, pp. 456–458 (2010)
Cockayne E.J., Dawes R.M., Hedetniemi S.T.: Total domination in graphs. Networks 10, 211–219 (1980)
Felzenbaum A.: Packing lines in a hypercube. Discret. Math. 117, 107–112 (1993)
Fink J.F., Jacobson M.S., Kinch L.F., Roberts J.: The bondage number of a graph. Discret. Math. 86, 47–57 (1990)
Fitzpatrick S., Hartnell B.L.: Paired-domiantion. Discret. Math. Graph Theory 18(1), 63–72 (1998)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.): Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.): Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)
Haynes T.W., Slater P.J.: Paired-domination in graphs. Networks 32, 199–206 (1998)
Hell, P., Kirkpatrick, D.: On the complexity of a generalized matching problem. In: Proceedings of Tenth ACM Symposium On Theory of Computing, pp. 309–318 (1978)
Henning M.A.: A survey of selected recent results on total domination in graphs. Discret. Math. 309(1), 32–63 (2009)
Hosoya H., Tsukano Y., Nakada K., Iwata S., Nagashima U.: Supersymmetry of hexabenzocoronene torus. CCACAA 77(1–2), 89–95 (2004)
Hu F.-T., Xu J.-M.: On the complexity of the bondage and reinforcement problems. J. Complex. 28(2), 192–201 (2012)
Kulli, V.R., Patwari, D.K.: The total bondage number of a graph. In: Advances in Graph Theory, pp. 227–235. Vishwa International Publications (1991)
Qiao H., Kang L., Cardei M., Du D.: Paired-domination of trees. J. Glob. Optim. 25, 43–54 (2003)
Rajasingh I., Muthumalai A., Bharathi R., Shanthi A.S.: Packing in honeycomb networks. J. Math. Chem. 50, 1200–1209 (2012)
Soltankhah N.: Results on total domination and total restrained domination in grid graphs. Int. Math. Forum 5, 2319–2332 (2010)
Yap H.P.: Packing of graphs—a survey. Discret. Math. 72, 395–404 (1988)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Quadras, J., Albert, S.M.M. Domination Parameters in Coronene Torus Network. Math.Comput.Sci. 9, 169–175 (2015). https://doi.org/10.1007/s11786-015-0222-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-015-0222-4