The orientable numbers of a graph
For a directed graph \(D\), the directed distance \(d(u,v)\) from a vertex \(u\) to a vertex \(v\) is the length of the shortest directed \(u-v\) path. The convexity number, hull number and geodetic number can be defined in a natural manner. Any connected graph has orientations with different geodetic numbers and orientations with different hull numbers. The lower orientable hull number \(h^{-}(G)\) is defined as the minimum hull number among all the orientations of \(G\) and the upper orientable hull number \(h^+(G)\) as the maximum hull number among all the orientations of \(G\). The lower and upper orientable geodetic numbers \(g^-(G)\) and \(g^+(G)\) are defined similarly. This paper investigates characterizations of the orientable numbers and conditions that the relation \(h^-(G)\leq g^-(G)<h^+(G)\leq g^+(G)\) holds.
- The hull and geodetic numbers of orientations of graphs
- The hull number of an oriented graph
- scientific article; zbMATH DE number 2076940 (Why is no real title available?)
- Hull and geodetic numbers for some classes of oriented graphs
- Hull and geodetic numbers for some classes of oriented graphs
- Convexity in oriented graphs
This page was built for publication: The orientable numbers of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925912)
