The oriented diameter of graphs with given connected domination number and distance domination number

DOI10.1007/S00373-023-02741-WMaRDI QIDQ6154372zbMATH OpenWikidataFDO

Authors Peter Dankelmann, Jane Morgan, Emily Rivett-Carnac

Publication date 15 February 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

dominationconnected dominationdistance dominationoriented diameterorientation number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)

Recommendations

• Bounds for the minimum oriented diameter
• Bounds for the minimal oriented diameter
• Oriented diameter of graphs with given girth and maximum degree
• The oriented diameter of a bridgeless graph with given \(P_3\)
• Diameter of orientations of graphs with given minimum degree

Cites work

• A complete characterisation of vertex-multiplications of trees with diameter 5
• A degree condition for diameter two orientability of graphs
• A size condition for diameter two orientable graphs
• AT-free graphs: Linear bounds for the oriented diameter
• An improvement to Chvátal and Thomassen's upper bound for oriented diameter
• Arc reversals of cycles in orientations of \(G\) vertex-multiplications
• Bounds for the minimum oriented diameter
• Bounds for the oriented diameter of planar triangulations
• Complexity of approximating the oriented diameter of chordal graphs
• Diameter of orientations of graphs with given minimum degree
• Diameter three orientability of bipartite graphs
• Distances in orientations of graphs
• Improved bound on the oriented diameter of graphs with given minimum degree
• On optimal orientation of cycle vertex multiplications
• On optimal orientations of \(G\) vertex-multiplications
• Optimal orientations of Vertex-multiplications of Trees with Diameter 4
• Optimal orientations of graphs and digraphs: A survey
• Optimal orientations of vertex-multiplications of Cartesian products of graphs
• Oriented diameter of graphs with given maximum degree
• Oriented diameter of maximal outerplanar graphs

Cited in

(1)

• On 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

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