The Connected Detour Numbers of Special Classes of Connected Graphs
Keyword(s):
Simple finite connected graphs G=V,E of p≥2 vertices are considered in this paper. A connected detour set of G is defined as a subset S⊆V such that the induced subgraph GS is connected and every vertex of G lies on a u−v detour for some u,v∈S. The connected detour number cdnG of a graph G is the minimum order of the connected detour sets of G. In this paper, we determined cdnG for three special classes of graphs G, namely, unicyclic graphs, bicyclic graphs, and cog-graphs for Cp, Kp, and Km,n.
Keyword(s):
Keyword(s):
2012 ◽
Vol 04
(04)
◽
pp. 1250061
◽
Keyword(s):
Keyword(s):
2013 ◽
Vol 29
(11)
◽
pp. 2193-2208
◽
2019 ◽
Vol 19
(04)
◽
pp. 2050068
Keyword(s):
2013 ◽
Vol 22
(5)
◽
pp. 733-748
◽
Keyword(s):
2018 ◽
Vol 2018
◽
pp. 1-10
◽
Keyword(s):
2016 ◽
Vol 31
◽
pp. 232-243
◽
Keyword(s):
2016 ◽
Vol 09
(02)
◽
pp. 1650041