Distance in graphs -- taking the long view

MaRDI QIDQ1772194zbMATH OpenFDO

Authors Gary Chartrand, Ping Zhang

Publication date 15 April 2005

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

coloringdetour distancedetour numberdominationgeodesicsHamiltonian coloringHamiltonian-connected

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

The title aims at the fact that the paper is concerned with the detour distance \(D(u,v)\) in connected graphs, which is (for different vertices \(u\) and \(v\)) the length of a longest path joining \(u\) and \(v\). The paper is a survey without proofs. After a short introduction Section 2 surveys fundamental facts on the detour distance mainly referring to two papers by \textit{G. Chartrand, H. Escuadro} and \textit{P. Zhang} [``Detour distance in graphs and ``Extremal problems on distances in graphs, Congr. Numerantium 167, 133--147 (2004; Zbl 1064.05048)]. Section 3 considers connections to domination and is based on a recent paper by Chartrand, Haynes, Henning and Zhang. Section 4 combines the detour distance with (Hamiltonian) coloring and Hamiltonian connectedness and finally the detour number and geodesics (in graphs) are considered.

Recommendations

• scientific article; zbMATH DE number 434900
• scientific article; zbMATH DE number 2190091
• Detour graphs
• scientific article; zbMATH DE number 2192089
• Detour Wiener indices of graphs

Cited in

(21)

• The connected detour numbers of special classes of connected graphs
• The forcing connected detour number of a graph
• A cut locus for finite graphs and the farthest point mapping
• Weak edge triangle free detour number of a graph
• Upper triangle free detour number of a graph
• THE PATH INDUCED DETOUR NUMBER OF SOME GRAPHS
• scientific article; zbMATH DE number 7280158 (Why is no real title available?)
• Detour g-interior nodes and detour g-boundary nodes in bipolar fuzzy graph with applications
• Characterizations of graphs with prescribed connected detour numbers
• Uniform number of a graph
• The open detour number of a graph
• Graphs of edge-to-vertex detour number 2
• Characterization of Graphs of Connected Detour Number 2
• Social balance - a signed detour distance analysis
• Topologies induced by graph metrics on the vertex set of graphs
• The restricted detour radial graphs
• Computing edge version of restricted detour distance, polynomials and index of certain star graphs
• Changing the uniform spectrum by deleting edges
• Vertex sqare free detour number of a graph
• Bootstrap percolation, connectivity, and graph distance
• On the graph of large distances

This page was built for publication: Distance in graphs -- taking the long view

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