A note on 4-self-centered graphs
DOI:
https://doi.org/10.5269/bspm.63331Resumo
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.
Downloads
Publicado
2025-07-13
Edição
Seção
Artigos
Licença
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).
