Regular tournaments with minimum split domination number and cycle extendability

DOI10.1007/978-3-031-05375-7_13zbMath1500.05048OpenAlexW4295836672MaRDI QIDQ2089539

Kim A. S. Factor, Larry J. Langley, Sarah 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

separating settournamentdominationcycle extendabilitysplit domination

Mathematics Subject Classification ID

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

Cites Work

• Cycle extendability in graphs and digraphs
• Extending cycles in directed graphs
• On finding a minimum dominating set in a tournament
• On the bounded domination number of tournaments
• Split Domination, Independence, and Irredundance in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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