Abstract
Abstract An induced star-triangle factor of a graph G is a spanning subgraph F of G such that each component of F is an induced subgraph on the vertex set of that component and each component of F is a star (here star means either K1,n, n ≥ 2 or K2) or a triangle (cycle of length 3) in G. In this paper, we establish that every graph without isolated vertices admits an induced star-triangle factor in which any two leaves from different stars K1,n (n ≥ 2) are non-adjacent.
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 callSimilar Papers
Disclaimer: 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.
