On almost self-centered graphs and almost peripheral graphs

From MaRDI portal
Publication:2083239

DOI10.11650/TJM/220401zbMATH Open1498.05083arXiv2106.12148OpenAlexW3174637211MaRDI QIDQ2083239FDOQ2083239


Authors: Yanan Hu, Xingzhi Zhan Edit this on Wikidata


Publication date: 10 October 2022

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Abstract: An almost self-centered graph is a connected graph of order n with exactly n2 central vertices, and an almost peripheral graph is a connected graph of order n with exactly n1 peripheral vertices. We determine (1) the maximum girth of an almost self-centered graph of order n; (2) the maximum independence number of an almost self-centered graph of order n and radius r; (3) the minimum order of a k-regular almost self-centered graph and (4) the maximum size of an almost peripheral graph of order n; (5) which numbers are possible for the maximum degree of an almost peripheral graph of order n; (6) the maximum number of vertices of maximum degree in an almost peripheral graph of order n whose maximum degree is the second largest possible. Whenever the extremal graphs have a neat form, we also describe them.


Full work available at URL: https://arxiv.org/abs/2106.12148




Recommendations




Cites Work


Cited In (6)





This page was built for publication: On almost self-centered graphs and almost peripheral graphs

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