The oriented diameter of graphs with given connected domination number and distance domination number
From MaRDI portal
Publication:6154372
DOI10.1007/s00373-023-02741-wWikidataQ129052070 ScholiaQ129052070MaRDI QIDQ6154372
Emily Rivett-Carnac, Peter Dankelmann, Jane Morgan
Publication date: 15 February 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Improved bound on the oriented diameter of graphs with given minimum degree
- Distances in orientations of graphs
- On optimal orientations of \(G\) vertex-multiplications
- A degree condition for diameter two orientability of graphs
- AT-free graphs: Linear bounds for the oriented diameter
- Optimal orientations of graphs and digraphs: A survey
- Diameter three orientability of bipartite graphs
- Arc reversals of cycles in orientations of \(G\) vertex-multiplications
- An improvement to Chvátal and Thomassen's upper bound for oriented diameter
- Diameter of orientations of graphs with given minimum degree
- On optimal orientation of cycle vertex multiplications
- A size condition for diameter two orientable graphs
- Complexity of approximating the oriented diameter of chordal graphs
- Oriented diameter of graphs with given maximum degree
- A Complete Characterisation of Vertex-multiplications of Trees with Diameter 5
- Bounds for the minimum oriented diameter
- Optimal orientations of vertex-multiplications of cartesian products of graphs
- Optimal orientations of Vertex-multiplications of Trees with Diameter 4
- Oriented diameter of maximal outerplanar graphs
- Bounds for the oriented diameter of planar triangulations
This page was built for publication: The oriented diameter of graphs with given connected domination number and distance domination number
