AN ASSESSMENT ON THE SPLIT AND NON-SPLIT DOMINATION NUMBER OF TENEMENT GRAPHS
Main Article Content
Abstract
One of the primary fields of mathematics, graph theory is an intriguing and exciting subject. A network is
represented mathematically by a graph, which identifies the connections between nodes and edges. One
of the fascinating areas of mathematics is Graph Theory. A large area of graph theory is called
dominance in graphs. Claude Berge formalised dominance as a theoretical field in graph theory.
Domination is one of the fascinating and active areas of Graph Theory research. In this paper, we first
provide basic definitions, outlining both core ideas and certain dominant concepts. In specifically,
Tenement graphs, a novel type of graph, are defined. Tenement graphs' Split and Non-Split Domination
Numbers are addressed.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
This is an Open Access article distributed under the terms of the Attribution-Noncommercial 4.0 International License [CC BY-NC 4.0], which requires that reusers give credit to the creator. It allows reusers to distribute, remix, adapt, and build upon the material in any medium or format, for noncommercial purposes only.