Abstract
AbstractIn this paper, we first investigate the total proper connection number of a graphGGaccording to some constraints ofG¯\overline{G}. Next, we investigate the total proper connection numbers of graphGGwith large clique numberω(G)=n−s\omega \left(G)=n-sfor1≤s≤31\le s\le 3. Finally, we determine the total properkk-connection numbers of circular ladders, Möbius ladders and all small cubic graphs of order 8 or less.
Sign-in/Register to access full text options 
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.
