Maximum Oriented Forcing Number for Complete Graphs

DOI10.20429/tag.2019.060106zbMath1429.05153arXiv1709.07509OpenAlexW2962948990WikidataQ127657941 ScholiaQ127657941MaRDI QIDQ5205655

Ryan Pepper, Yair Caro

Publication date: 13 December 2019

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.07509

zbMATH Keywords

tournamentsforcing numberzero forcing number\(k\)-forcing numberzero forcing sets\(k\)-forcing setsmaximum oriented forcingoriented complete graphs

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)

This page was built for publication: Maximum Oriented Forcing Number for Complete Graphs