On optimal orientations of Cartesian products of trees
From MaRDI portal
An orientation \(D\) of a graph \(G\) is \((r,d)\)-invariant if the radius of \(D\) equals the radius of \(G\) and the diameter of \(D\) equals the diameter of \(G\). The authors prove that the Cartesian product of trees \(\prod^n_{i=1} T_i\) admits an \((r,d)\)-invariant orientation provided that \(\text{diam}(T_1)\geq \text{diam}(T_2)\geq 4\) for \(n=2\), and \(\text{diam}(T_1)\geq 5\), \(\text{diam}(T_2)\geq 4\) for \(n= 3\).
Recommendations
- On optimal orientations of Cartesian products of graphs. I
- On optimal orientations of Cartesian products with a bipartite graph
- The diameter of strong orientations of Cartesian products of graphs
- On optimal orientations of Cartesian products of even cycles
- On optimal orientations of Cartesian products of even cycles and paths
Cited in
(13)- On a conjecture concerning the orientation number of a graph
- On optimal orientations of Cartesian products of graphs. I
- The diameter of strong orientations of Cartesian products of graphs
- A degree condition for diameter two orientability of graphs
- On optimal orientations of Cartesian products with a bipartite graph
- scientific article; zbMATH DE number 4010534 (Why is no real title available?)
- On optimal orientations of Cartesian products of even cycles and paths
- The diameter of strong orientations of strong products of graphs
- Optimal orientations of strong products of paths
- The orientation number of two complete graphs with linkages
- Optimal orientations of vertex-multiplications of Cartesian products of graphs
- On the unavoidability of oriented trees
- The optimal strong radius and optimal strong diameter of the Cartesian product graphs
This page was built for publication: On optimal orientations of Cartesian products of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936094)
