Abstract
In this paper, we mainly investigate graphs with a small (strong) proper connection number and a large clique number. First, we discuss the (strong) proper connection number of a graph G of order n and ω(G)=n−i for 1⩽i⩽3. Next, we investigate the rainbow connection number of a graph G of order n, diam(G)≥3 and ω(G)=n−i for 2⩽i⩽3.
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 callDisclaimer: 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.
