Abstract
Graphs considered here are simple, finite and undirected. A graph is denoted by [Formula: see text] and its vertex set by [Formula: see text] and edge set by [Formula: see text]. Kulli and Janakiram introduced the concept of the strong non-split domination number of a graph [The strong non-split domination number of a graph, Int. J. Manag. Syst. 19 (2003) 2]. The concept of fair domination was introduced by Yaro Caro et al. in [Fair domination in graphs, Discrete Math. 312 (2012) 2905–2914]. This paper is an outcome of the combination of these two concepts.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Discrete mathematics, algorithms, and applications
Paper Title
Journal
Date
