Distance in digraphs

DOI10.1016/S0898-1221(97)00216-2zbMath0903.05018OpenAlexW2038943847MaRDI QIDQ1388969

Gary Chartrand, Songlin Tian

Publication date: 11 June 1998

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(97)00216-2

zbMATH Keywords

digraphdistance

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Lexicographic product of digraphs and related boundary-type sets ⋮ On extremal spectral results of digraphs based on sum distance ⋮ Unnamed Item ⋮ Boundary vertices of Cartesian product of directed graphs ⋮ On the strong distance problems of pyramid networks ⋮ The strong distance problem on the Cartesian product of graphs ⋮ Strong orientations of complete \(k\)-partite graphs achieving the strong diameter ⋮ Boundary-type sets of strong product of directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dissimilarity characteristic of Husimi trees
• Medians of arbitrary graphs
• On graphs containing a given graph as center
• On graphs with prescribed median I

This page was built for publication: Distance in digraphs