Abstract
The total proper connection number of a given digraph D, represented by $$\overrightarrow{tpc}(D)$$ , denotes the smallest number of colors needed for making D total proper connected. The strong total proper connection number of D, represented by $$\overrightarrow{stpc}(D)$$ , shows the smallest number of colors required for making D strong total proper connected. In the present work, we represent some preliminary findings on $$\overrightarrow{tpc}(D)$$ and $$\overrightarrow{stpc}(D)$$ . Moreover, findings on the (strong) total proper connection numbers of biorientations of graphs, circle digraphs, circulant digraphs and cacti digraphs are provided.
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.
