Regular tournaments with minimum split domination number and cycle extendability

DOI10.1007/978-3-031-05375-7_13MaRDI QIDQ2089539zbMATH OpenOpenAlexFDO

Authors K. A. S. Factor, Larry J. Langley, S. K. Merz

Publication date 22 October 2022

Full work available at URL https://doi.org/10.1007/978-3-031-05375-7_13

zbMATH Keywords

cycle extendabilitydominationseparating setsplit dominationtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Cycle extendability and split domination in tournaments
• Split domination in digraphs
• Domination graphs of regular tournaments
• scientific article; zbMATH DE number 1416469
• The domination graph of a regular multipartite tournament

Cites work

• Cycle extendability and split domination in tournaments
• Cycle extendability in graphs and digraphs
• Extending cycles in directed graphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2104726 (Why is no real title available?)
• On finding a minimum dominating set in a tournament
• On the bounded domination number of tournaments
• Split domination in digraphs
• Split Domination, Independence, and Irredundance in Graphs

Cited in

(4)

• scientific article; zbMATH DE number 3950564 (Why is no real title available?)
• Split domination in digraphs
• Cycle extendability and split domination in tournaments
• Status split and nonsplit domination in graphs

This page was built for publication: Regular tournaments with minimum split domination number and cycle extendability

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