On oriented diameter of \((n, k)\)-star graphs

DOI10.1016/J.DAM.2022.04.017zbMATH Open1542.05045MaRDI QIDQ6558685

K. S. Ajish Kumar, Birenjith Sasidharan, K. S. Sudeep

Publication date: 20 June 2024

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

zbMATH Keywords

strong orientation\((n, k)\)-star graphsoriented diameter

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unidirectional star graphs
• Distances in orientations of graphs
• Orienting the arrangement graphs
• Minimizing the oriented diameter of a planar graph
• Robbins's Theorem for Mixed Multigraphs
• Complexity of approximating the oriented diameter of chordal graphs
• Diameter-preserving orientations of the torus
• An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter
• TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: On oriented diameter of \((n, k)\)-star graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558685)