Secure Fair Domination in the Join of Two Graphs
Abstract
Let G be a connected simple graph.A dominating setand the set S ∖ v ∪ {u} is a fair dominating set of G.The minimum cardinality of a secure fair dominating set of G, denoted by γ sfd (G), is called the secure fair domination number of G.In this paper, we give some results on the secure fair domination in the join of two nontrivial connected graphs.
Fields of Study & Subjects
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Graph theory and applications
Publication details
- Journal / source
- International Journal of Latest Engineering Research and Applications (IJLERA)
- Volume
- 11
- Issue
- 1
- Pages
- 1–9
- Publication date
- 1 February 2026
- Language
- EN