Relations on irredundance and domination number for six regular graph with girth 3
Downloads
DOI:
https://doi.org/10.26637/MJM0803/0021Abstract
In this paper, we discuss about the irredundant number, upper irredundnat number and domination number denoted by \(\operatorname{ir}(G(n)), I R(G(n))\) and \(\gamma(G(n))\) respectively for 6-regular graphs of \(n\) vertices with girth 3 . Here, \(G(n)\) denotes the 6-regular graphs on \(n\) vertices with girth 3 . We further establish some relation between \(\operatorname{ir}(G(n)), I R(G(n))\) and \(\gamma(G(n))\).
Keywords:
6-regular graph, Girth, Irredundant set, Irredundant number, Dominating set, Domination numberMathematics Subject Classification:
Mathematics- Pages: 856-861
- Date Published: 01-07-2020
- Vol. 8 No. 03 (2020): Malaya Journal of Matematik (MJM)
E.J. Cockayne and C.M. Mynhardt, The sequence of upper and lower domination, independence and irredundance numbers of a graph, Discrete Mathematics, 122(1993), 89-102.
S. DelbinPrema and C. Jayasekaran, Relations on Irredundance and domination number in Quartic graphs with girth 3, Journal of Advanced Research in Dynamical and Control Systems, 10(14)(2018), 1719-1729.
T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker Inc. New York., Vol. 208 (1998).
T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, New York , (1998).
O. Ore, Theory of Graphs, American Mathematical Society. Colloq. Publ. (American Mathematical Soc. Providence. $R I), 38(1962)$.
D.B. West, Introduction to Graph Theory, Second Ed., Prentice-Hall, Upper Saddle River, NJ, (2001).
- NA
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.
