Abstract

Since Cohen introduced the competition graph in 1968, the competition graph has been studied widely and many variations of it have been discussed. In 2000, Cho, Kim and Nam defined and studied the m -step competition graph and computed the 2-step competition numbers of paths and cycles. Recently, Ho gave bounds for the m -step competition numbers of paths and cycles. In this paper we continue to study the m -step competition numbers of paths and cycles, partially improve the results of Ho on the upper bounds of the m -step competition numbers of paths and cycles, and show that a conjecture posed by Ho is not true.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.