A Note on Improved bounds for the Oriented Radius of Mixed Multigraphs
H Li, Z Ding, J Liu, Y Gao, S Zhao - arXiv preprint arXiv:2407.01612, 2024 - arxiv.org
For a positive integer $ r $, let $ f (r) $ denote the smallest number such that any 2-edge
connected mixed graph with radius $ r $ has an oriented radius of at most $ f (r) $. Recently …
connected mixed graph with radius $ r $ has an oriented radius of at most $ f (r) $. Recently …
Diameter two orientability of mixed graphs
H Li, Z Ding, J Liu, HJ Lai - arXiv preprint arXiv:2408.10809, 2024 - arxiv.org
In 1967, Katona and Szemer\'{e} di showed that no undirected graph with $ n $ vertices and
fewer than $\frac {n}{2}\log_2\frac {n}{2} $ edges admits an orientation of diameter two. In …
fewer than $\frac {n}{2}\log_2\frac {n}{2} $ edges admits an orientation of diameter two. In …
On the oriented diameter of planar triangulations
D Mondal, N Parthiban, I Rajasingh - Journal of Combinatorial …, 2024 - Springer
The diameter of an undirected or a directed graph is defined to be the maximum shortest
path distance over all pairs of vertices in the graph. Given an undirected graph G, we …
path distance over all pairs of vertices in the graph. Given an undirected graph G, we …