The connected detour numbers of special classes of connected graphs

DOI10.1155/2019/8272483MaRDI QIDQ2300002zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 24 February 2020

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/8272483

zbMATH Keywords

bicyclic graphcog graphdetour number

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Review text

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.

Recommendations

• On the connected detour number of a graph
• The connected detour number of a graph
• The connected vertex detour number of a graph
• Characterizations of graphs with prescribed connected detour numbers
• Characterization of Graphs of Connected Detour Number 2
• The forcing connected detour number of a graph
• scientific article; zbMATH DE number 94965
• The connected forcing connected vertex detour number of a graph
• The upper connected vertex detour number of a graph
• THE PATH INDUCED DETOUR NUMBER OF SOME GRAPHS

Cites work

• n-edge-distance-balanced graphs
• Distance in graphs -- taking the long view
• Edge detour graphs
• Edge-to-vertex detour number of a graph
• scientific article; zbMATH DE number 6506585 (Why is no real title available?)
• scientific article; zbMATH DE number 2028640 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• On edge detour graphs
• On the connected detour number of a graph
• The connected detour monophonic number of a graph
• The total detour number of a graph
• Wiener, hyper-Wiener, detour and hyper-detour indices of bridge and chain graphs

Cited in

(4)

• Detour polynomials of vertex coalenscence and bridges coalenscence graphs
• Characterizations of graphs with prescribed connected detour numbers
• Characterization of Graphs of Connected Detour Number 2
• Zagreb indices for chains of identical hexagonal cycles

This page was built for publication: The connected detour numbers of special classes of connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300002)