Proper Centre of Graphs
A graph is said to be properly connected if there exists a properly edge colored path between every pair of vertices in it. The centre of a graph is a set that consists of the vertices of minimum eccentricity. In this paper, we define the proper centre in properly connected graphs. We characterise proper centre in graphs that have proper connection number 2.
Authors
- Tabitha Agnes Mangam (ORCID: https://orcid.org/0000-0002-2960-9392)
- H R Deepika
Institutions
- Christ University (IN)
Publication Details
- Journal
- Acta Universitatis Sapientiae Informatica
- Published
- 2025-11-10
- DOI
- https://doi.org/10.1007/s44427-025-00013-4
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00