Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Proper Centre of Graphs

  • 期刊论文

  • 发表日期：

    2025年11月10日

查看全文
  • H R Deepika,
  • Tabitha Agnes Mangam

摘要

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.