@article {
author = {Abrishami, Gholamreza and Rahbarnia, Freydoon and Rezaee, Irandokht},
title = {Diameter Two Graphs of Minimum Order with Given Degree Set},
journal = {Mathematics Interdisciplinary Research},
volume = {1},
number = {2},
pages = {317-323},
year = {2016},
publisher = {University of Kashan},
issn = {2538-3639},
eissn = {2476-4965},
doi = {10.22052/mir.2016.34107},
abstract = {The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for a given set of natural numbers greater than one, we determine the minimum order of a 2-self-centered graph with that degree set.},
keywords = {Degree set,self-centered graph,radius,diameter},
url = {https://mir.kashanu.ac.ir/article_34107.html},
eprint = {https://mir.kashanu.ac.ir/article_34107_f8c714c2b1ea6bcadfdfe4ef88683da2.pdf}
}