Open AccessEquitably strong nonsplit equitable domination in graphs
Author(s) -
P. S. V. Nataraj,
R. Sundareswaran,
V. Swaminathan
Publication year - 2021
Publication title -
proyecciones
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.226
H-Index - 12
eISSN - 0717-6279
pISSN - 0716-0917
DOI - 10.22199/issn.0717-6279-4497
Subject(s) - combinatorics , vertex (graph theory) , undirected graph , graph , mathematics , domination analysis , simple graph , discrete mathematics
In a simple, finite and undirected graph G with vertex set V and edge set E, Prof. Sampathkumar defined degree equitability among vertices of G. Two vertices u and v are said to be degree equitable if |deg(u) − deg(v)| ≤ 1. Equitable domination has been defined and studied in [7]. V.R.Kulli and B.Janakiram defined strong non - split domination in a graph [12]. In this paper, the equitable version of this new type of domination is studied