Characterization of graphs of connected detour number 2

KRAGUJEVAC JOURNAL OF MATHEMATICS(2023)

引用 0|浏览1
暂无评分
摘要
Let G = (V, E) be a connected graph of order P(G) >= 2. The con-nected detour number of G, denoted cdn(G), is introduced and studied by A. P. Santhakumaran and S. Athisayanathan [7]. In this paper, we characterize connected graph G of cdn(G) = 2 and of detour diameter D(G) = 5, 6.
更多
查看译文
关键词
Detour distance,detour number,connected detour number
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要