Equitably strong non-split equitable domination in graphs
Abstract 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 studi...
Enregistré dans:
| Auteurs principaux: | Nataraj,P., Sundareswaran,R., Swaminathan,V. |
|---|---|
| Langue: | English |
| Publié: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
| Sujets: | |
| Accès en ligne: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000400989 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Equi independent equitable dominating sets in graphs
par: Vaidya,S. K., et autres
Publié: (2016) -
Equitable total chromatic number of splitting graph
par: Jayaraman,G., et autres
Publié: (2019) -
A linear time algorithm for minimum equitable dominating set in trees
par: Rana,Sohel, et autres
Publié: (2021) -
On the upper geodetic global domination number of a graph
par: Lenin Xaviour,X., et autres
Publié: (2020) -
The nonsplit domination in subdivision graph
par: Chrislight,R. Jemimal, et autres
Publié: (2020)