scientific article; zbMATH DE number 2190091

zbMATH Open1074.05029MaRDI QIDQ5462147FDOQ5462147

Authors: Gary Chartrand, Henry Escuadro, Ping Zhang 

Publication date: 1 August 2005

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 434900
• scientific article; zbMATH DE number 861351
• Detour Wiener indices of graphs
• Detour graphs
• The connected detour number of a graph

zbMATH Keywords

detour centerdetour eccentricitydetour peripherydetour radius

Mathematics Subject Classification ID

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

Cited In (37)

• Detour \(g\)-interior nodes and detour \(g\)-boundary nodes in bipolar fuzzy graph with applications
• Edge-to-vertex \(m\)-detour monophonic number of a graph
• Distance in graphs -- taking the long view
• Monophonic-triangular distance in graphs
• The detour domination number of a graph
• Topologies induced by graph metrics on the vertex set of graphs
• Detour trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fréchet-Distance on Road Networks
• Vertex-to-clique detour distance in graphs
• Characterizations of graphs with prescribed connected detour numbers
• Triangle free detour distance in graphs
• Detour polynomials of vertex coalenscence and bridges coalenscence graphs
• The edge signal number of a graph
• Characterization of Graphs of Connected Detour Number 2
• Forcing weak edge triangle free detour number of a graph
• Weak edge triangle free detour number of a graph
• Upper detour monophonic number of a graph
• Detour graphs
• On Hamiltonian colorings of block graphs
• Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
• Clique-to-vertex monophonic distance in graphs
• Detour eccentric and detour distance degree sequences in graphs
• Title not available (Why is that?)
• Interior vertices and boundary vertices using geodesic and detour distances
• Graphs of edge-to-vertex detour number 2
• Upper triangle free detour number of a graph
• A cut locus for finite graphs and the farthest point mapping
• Title not available (Why is that?)
• Vertex-to-edge centers w.r.t. \(D\)-distance
• Title not available (Why is that?)
• Title not available (Why is that?)
• The forcing connected detour number of a graph
• A study on signal distance in graphs
• Detour Wiener indices of graphs

This page was built for publication:

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