A note on 4-self-centered graphs

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.

Authors

Institutions

Publication Details

Journal
Boletim da Sociedade Paranaense de Matemática
Published
2025-07-13
DOI
https://doi.org/10.5269/bspm.63331
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A note on 4-self-centered graphs

Arijit Mishra
Boletim da Sociedade Paranaense de Matemática
Advanced Graph Theory Research
article

A note on 4-self-centered graphs

Arijit Mishra
article en

Abstract

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.

Boletim da Sociedade Paranaense de MatemáticaVol. 43
Gauhati University (IN)
Openalex Percentile: Top 81%
Advanced Graph Theory Research
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A note on 4-self-centered graphs — Arijit Mishra · Boletim da Sociedade Paranaense de Matemática (2025) | TGRS Research Map | TGRS