Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Mathematics

Georgia Southern University

Journal

2019

K-forcing

Articles 1 - 1 of 1

Full-Text Articles in Physical Sciences and Mathematics

Maximum Oriented Forcing Number For Complete Graphs, Yair Caro, Ryan Pepper May 2019

Maximum Oriented Forcing Number For Complete Graphs, Yair Caro, Ryan Pepper

Theory and Applications of Graphs

The maximum oriented k-forcing number of a simple graph G, written MOFk(G), is the maximum directed k-forcing number among all orientations of G. This invariant was recently introduced by Caro, Davila and Pepper in [6], and in the current paper we study the special case where G is the complete graph with order n, denoted Kn . While MOFk(G) is an invariant for the underlying simple graph G, MOFk(Kn) can also be interpreted as an interesting property for tournaments. Our main results …