A note on 4-self-centered graphs
Résumé
A graph G is said to be 4-self-centered if the eccentricity of each of its vertices is 4. In this paper, we discuss some properties associated to 4-self-centered graphs. We obtain its degree and girth and also the maximum number of triangles in such graphs. We also establish the existence of 8-cycles and 9-cycles in these graphs.
Téléchargements
Les données sur le téléchargement ne sont pas encore disponible.
Publiée
2025-07-13
Numéro
Rubrique
Research Articles
Copyright (c) 2025 Boletim da Sociedade Paranaense de Matemática
Ce travail est disponible sous la licence Creative Commons Attribution 4.0 International .
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).
