Oriented diameter of star graphs

DOI10.1007/978-3-030-39219-2_25zbMath1453.68117arXiv1911.10340OpenAlexW3004331074MaRDI QIDQ5896108

K. S. Sudeep, Deepak Rajendraprasad, K. S. Ajish Kumar

Publication date: 21 July 2020

Published in: Discrete Applied Mathematics, Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

star graphsstrong orientationoriented diameter

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15) Distributed systems (68M14) Directed graphs (digraphs), tournaments (05C20) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (2)

Bounds for the oriented diameter of planar triangulations ⋮ Large girth and small oriented diameter graphs

Cites Work

• Unidirectional star graphs
• Distances in orientations of graphs
• AT-free graphs: Linear bounds for the oriented diameter
• Minimizing the Oriented Diameter of a Planar Graph
• A group-theoretic model for symmetric interconnection networks
• Complexity of approximating the oriented diameter of chordal graphs
• Diameter-preserving orientations of the torus
• Oriented diameter of graphs with given maximum degree
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: Oriented diameter of star graphs