The connected detour numbers of special classes of connected graphs (Q2300002): Difference between revisions

This paper studies the connected detour numbers for connected bicyclic graphs as well as cog graphs. If a detour set \(S\) of a graph \(G\) and the induced subgraph \(G[S]\) is connected, \(S\) is referred to as the connected detour set of \(G\). The connected detour number of \(G\), \(cdn(G)\), is the minimum order of \(S\) so that \(S\) is a connected detour set of \(G\). If \(G\) is a connected unicyclic graph of order \(p\ge5\) with \(l\)-cycle with \(l\ge4\), then \(cdn(G)=p-1\) if and only if the induced subgraph \(G[T(G)]\) consists of \(n\) components, where \(T(G)\) is defined as the set of vertices \(v\), to which it applies \(v\) is either a cut vertex or an end vertex in \(G\). For a complete bipartite graph \(K_{m,n}\) with \(m,n\ge2\), it is shown that for any pair of adjacent vertices \(u\), \(v\) every edge other than \(uv\) lies on a \(u\)-\(v\) detour in \(K_{m,n}\). Consequently, every such complete bipartite graph has a cog graph connected detour number 2.