A Note on Separation Number of Graphs
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
In this paper, the concept of total domination is used to introduce a new graph parameter, called the separation number Sn(G) of a graph G. We study the fundamental properties of this parameter and establish general lower and upper bounds for Sn(G). Furthermore, the separation number is determined for various classes of graphs, including complete graphs and star graphs. We also examine the behavior of Sn(G) under specific graph operations such as the corona of graphs and the conormal product of complete graphs.
Fields of Study & Subjects
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Graph theory and applications
Publication details
- Journal / source
- Journal of Advances in Mathematics and Computer Science
- Volume
- 41
- Issue
- 4
- Pages
- 125–130
- Publication date
- 30 March 2026
- Language
- EN