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

dominationgeodesicscoloringHamiltonian-connectedHamiltonian coloringdetour distancedetour number

Mathematics Subject Classification ID

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

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

(17)

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

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)