COMPLEMENTARY FAIR DOMINATION IN GRAPHS
-
Published:2023-09-30
Issue:3
Volume:23
Page:765-772
-
ISSN:2068-3049
-
Container-title:Journal of Science and Arts
-
language:en
-
Short-container-title:J. Sci. Arts
Author:
VENKATASUBRAMANIAN SWAMINATHAN1, SUNDARESWARAN RAMAN2
Affiliation:
1. Ramanujan Research Center in Mathematics, Saraswathi Narayan College, Madurai, India. 2. Sri Sivasubramaniya Nadar College of Engineering, Department of Mathematics, Chennai, India.
Abstract
In a simple, finite undirected graph G, a dominating set D is a subset of the vertex set V(G) whose closed neighbourhood is V(G). Many types of domination have been studied. The studies are based either on the nature of domination or the type of dominating set or the type of the complement of the dominating set. Interaction between dominating set and its complement is also considered. Fair domination is the domination where every vertex in the complement of a dominating set has equal number of neighbours in the dominating set. In this paper, a dominating set whose vertices have equal number of neighbours in the complement is the subject of study. The parameter γ_cof (G) is introduced and studied.
Publisher
Valahia University of Targoviste - Journal of Science and Arts
Subject
General Earth and Planetary Sciences,General Environmental Science
Reference10 articles.
1. Haynes, T.W., Hedetniemi, S.T., Slater, P.J., Fundamentals of domination in graphs, Mercel Dekker Inc, New York, 1998. 2. Harary, F., Graph Theory, Addison-Wesley, Boston, 1969. 3. Meyer, W., American Mathematical Monthly, 80, 920, 1973. 4. Caro, Y., Hansberg, A., Henning, M., Discrete Mathematics, 312(19), 2905, 2012. 5. Swaminathan, V., Sundareswaran, R., Lakshmanaraj, D., Nataraj, P., Muthusubramanian, L., Algorithms Applications, 13(6), 2150083, 2021.
|
|