Distance in digraphs
From MaRDI portal
The authors recall known results concerning distance in a graph and standard distance in a digraph. They define two new distances in strong digraphs: \(d_{\max} (u,v)= \max (d(u,v),\;d(v,u))\) and \(d_{\text{sum}} (u,v)= d(u,v) +d(v,u)\). Several results and problems concerning these distances and parameters such as center, median, and periphery are described.
Recommendations
Cites work
- scientific article; zbMATH DE number 3908466 (Why is no real title available?)
- scientific article; zbMATH DE number 19216 (Why is no real title available?)
- scientific article; zbMATH DE number 95269 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 975391 (Why is no real title available?)
- Medians of arbitrary graphs
- On graphs containing a given graph as center
- On graphs with prescribed median I
- The dissimilarity characteristic of Husimi trees
Cited in
(17)- Boundary vertices of Cartesian product of directed graphs
- On extremal spectral results of digraphs based on sum distance
- On the strong distance problems of pyramid networks
- Distances of centroid sets in a graph-based construction for information security applications
- Boundary-type sets of strong product of directed graphs
- scientific article; zbMATH DE number 1029226 (Why is no real title available?)
- scientific article; zbMATH DE number 1153390 (Why is no real title available?)
- Center of Cartesian and strong product of digraphs
- Center and periphery of lexicographic product of digraphs
- On spectral properties of digraphs about maximum distance
- Remarks on fixed point assertions in digital topology. VIII
- Remarks on fixed point assertions in digital topology. X
- Remarks on fixed point assertions in digital topology. IX
- Remarks on fixed point assertions in digital topology. XI
- Lexicographic product of digraphs and related boundary-type sets
- The strong distance problem on the Cartesian product of graphs
- Strong orientations of complete k-partite graphs achieving the strong diameter
This page was built for publication: Distance in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388969)
