Abstract
AbstractA generalized ‐independent set is a set of vertices such that the induced subgraph contains no trees with ‐vertices, and the generalized ‐independence number is the cardinality of a maximum ‐independent set in . Zito proved that the maximum number of maximum generalized 2‐independent sets in a tree of order is if is odd, and if is even. Tu et al. showed that the maximum number of maximum generalized 3‐independent sets in a tree of order is if , and if , and if and they characterized all the extremal graphs. Inspired by these two nice results, we establish four structure theorems about maximum generalized ‐independent sets in a tree for a general integer . As applications, we show that the maximum number of generalized 4‐independent sets in a tree of order is and we also characterize the structure of all extremal trees with the maximum number of maximum generalized 4‐independent sets.
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.
