scientific article; zbMATH DE number 2190091
From MaRDI portal
Publication:5462147
Recommendations
Cited in
(43)- Distance in graphs -- taking the long view
- Detour trees
- On Hamiltonian colorings of block graphs
- Detour Wiener indices of graphs
- The forcing connected detour number of a graph
- Clique-to-vertex monophonic distance in graphs
- The detour domination number of a graph
- A study on signal distance in graphs
- Fréchet-Distance on Road Networks
- scientific article; zbMATH DE number 434900 (Why is no real title available?)
- Upper detour monophonic number of a graph
- Edge-to-vertex m-detour monophonic number of a graph
- Detour eccentric and detour distance degree sequences in graphs
- Vertex-to-edge centers w.r.t. D-distance
- scientific article; zbMATH DE number 5722470 (Why is no real title available?)
- Detour graphs
- Triangle free detour distance in graphs
- scientific article; zbMATH DE number 2170458 (Why is no real title available?)
- scientific article; zbMATH DE number 2170483 (Why is no real title available?)
- scientific article; zbMATH DE number 861351 (Why is no real title available?)
- A cut locus for finite graphs and the farthest point mapping
- The edge signal number of a graph
- Weak edge triangle free detour number of a graph
- Upper triangle free detour number of a graph
- Detour polynomials of vertex coalenscence and bridges coalenscence graphs
- scientific article; zbMATH DE number 7280158 (Why is no real title available?)
- Vertex-to-clique detour distance in graphs
- Detour g-interior nodes and detour g-boundary nodes in bipolar fuzzy graph with applications
- Characterizations of graphs with prescribed connected detour numbers
- scientific article; zbMATH DE number 6729997 (Why is no real title available?)
- scientific article; zbMATH DE number 2192089 (Why is no real title available?)
- Graphs of edge-to-vertex detour number 2
- Characterization of Graphs of Connected Detour Number 2
- Topologies induced by graph metrics on the vertex set of graphs
- Interior vertices and boundary vertices using geodesic and detour distances
- Monophonic-triangular distance in graphs
- Forcing weak edge triangle free detour number of a graph
- Detour domination number of generalized mesh networks
- Computing edge version of restricted detour distance, polynomials and index of certain star graphs
- Roman detour domination number of generalized hypercube networks
- Fair detour domination of graphs
- Balanced beneficiaries center of the graph
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
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)
