The maximum number of maximum generalized 4‐independent sets in trees
A generalized k $k$‐independent set is a set of vertices such that the induced subgraph contains no trees with k $k$‐vertices, and the generalized k $k$‐independence number is the cardinality of a maximum k $k$‐independent set in G $G$. Zito proved that the maximum number of maximum generalized 2‐in...
Saved in:
Published in | Journal of graph theory Vol. 107; no. 2; pp. 359 - 380 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Hoboken
Wiley Subscription Services, Inc
01.10.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!