The diameter of strong orientations of strong products of graphs

DOI10.2989/16073606.2020.1754958zbMath1487.05079arXiv1909.12022OpenAlexW3022572800MaRDI QIDQ5163023

Irena Hrastnik Ladinek, Simon Špacapan

Publication date: 8 November 2021

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.12022

zbMATH Keywords

diameterstrong productstrong orientation

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Orientations of graphs with maximum Wiener index
• Some remarks on Wiener index of oriented graphs
• Distances in orientations of graphs
• Optimal orientations of products of paths and cycles
• On optimal orientations of Cartesian products of graphs. I
• The diameter of strong orientations of Cartesian products of graphs
• On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
• Counterexamples to Hedetniemi's conjecture
• On the sum of all distances in a graph or digraph
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
• On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
• On optimal orientations of Cartesian products of even cycles and paths
• Wiener index of strong product of graphs
• Optimal orientations of strong products of paths
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• On optimal orientations of Cartesian products of trees

This page was built for publication: The diameter of strong orientations of strong products of graphs