(Strong) Total proper connection of some digraphs

Given a set [Formula: see text] with [Formula: see text], a tree [Formula: see text] is considered as a total proper [Formula: see text]-tree or a total proper tree connecting [Formula: see text] if any two adjacent or incident elements of edges and [Formula: see text] of [Formula: see text] differ in color. Let [Formula: see text] be a connected graph of order [Formula: see text], and [Formula: see text] be an integer with [Formula: see text]. A total-colored graph is total proper[Formula: see text]-tree connected if for every set [Formula: see text] of [Formula: see text] vertices, there exists a total proper [Formula: see text]-tree in [Formula: see text]. The [Formula: see text]-total-proper index of [Formula: see text], denoted by [Formula: see text], is the minimum number of colors required to make [Formula: see text] total proper [Formula: see text]-tree connected. In this paper, we first investigate the [Formula: see text]-total-proper index of some special graphs. Moreover, we characterize the graphs with [Formula: see text]-total-proper index [Formula: see text] and [Formula: see text], respectively.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

(Strong) Total proper connection of some digraphs

Cited by 2 publications

References 18 publications

Some results on (strong) total proper connection number of some digraphs

Some results on (strong) total proper connection number of some digraphs

The k-Total-Proper Index of Graphs

Contact Info

Product

Resources

About