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...

Description complète

Enregistré dans:
Détails bibliographiques
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!