Abstract
AbstractA subset / of the nodes of a graph is a maximal independent set if no two nodes of / are joined to each other and every node not in / is joined to at least one node in /. We investigate the behavior of the average number e(n) and the average size μ(n) of maximal independent sets in trees Tn where the averages are over all trees Tn belonging to certain families of rooted trees. We find, under certain conditions, that e(n) ∼ q · En and μ(n) ∼ Sn as n → ∞, where q, E, and S are constants that depend on the family being considered.
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.
