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

DOI10.1016/J.DAM.2008.05.017zbMATH Open1176.05058OpenAlexW2081488270MaRDI QIDQ1003464FDOQ1003464

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

domination numberdiameterstrong connectivitybidirected graph

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: On a relation between the domination number and a strongly connected bidirection of an undirected graph

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