The equitable non-split domination number of graphs

DOI10.5206/MASE/18527MaRDI QIDQ6882300zbMATH OpenFDO

Authors Esther Samuel Jebisha, Valiyaveettil Abdul Naseema, Vivik Joseph Veninstine

Publication date 16 December 2025

Published in Mathematics in Applied Sciences and Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5206/MASE/18527

zbMATH Keywords

domination numberequitable coloringequitable non-split dominationnon-split domination number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• Equitable Coloring
• Equitable coloring of hypergraphs
• Equitable coloring planar graphs with large girth
• Global nonsplit domination in graphs
• Graph Colorings
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• On b-chromatic number of Sun let graph and wheel graph families
• Open neighborhood chromatic number of an antiprism graph
• Strong nonsplit dominating sets and strong nonsplit domination polynomial of complement of paths
• The nonsplit domination number of a graph
• Towards a theory of domination in graphs

Cited in

(1)

• Optimizing message dissemination in social networks through fuzzy regular equitable fair domination

This page was built for publication: The equitable non-split domination number of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6882300)