On a relation between the domination number and a strongly connected bidirection of an undirected graph

DOI10.1016/j.dam.2008.05.017zbMath1176.05058OpenAlexW2081488270MaRDI QIDQ1003464

Britta Peis, Martin Lätsch

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.017

zbMATH Keywords

diameterstrong connectivitydomination numberbidirected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Erratum to: T. Zaslavsky, signed graphs
• Orientation of signed graphs
• Distances in orientations of graphs
• Strongly connected orientations of mixed multigraphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control