A Characterization for 2-Self-Centered Graphs
A graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing edge-minimal 2-self-centered graphs into two cases. First, we ch...
Main Authors: | Shekarriz Mohammad Hadi, Mirzavaziri Madjid, Mirzavaziri Kamyar |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2018-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1994 |
Similar Items
-
On Selkow’s Bound on the Independence Number of Graphs
by: Harant Jochen, et al.
Published: (2019-08-01) -
On Double-Star Decomposition of Graphs
by: Akbari Saieed, et al.
Published: (2017-08-01) -
Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
by: Shyu Tay-Woei
Published: (2021-05-01) -
Some Results on the Independence Polynomial of Unicyclic Graphs
by: Oboudi Mohammad Reza
Published: (2018-05-01) -
The Complexity of Secure Domination Problem in Graphs
by: Wang Haichao, et al.
Published: (2018-05-01)