Distance in graphs -- taking the long view
From MaRDI portal
Recommendations
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)
