On the \(k\)-component independence number of a tree

DOI10.1155/2021/5540604zbMath1471.05077OpenAlexW3166777523MaRDI QIDQ2045314

Shuting Cheng, Baoyindureng Wu

Publication date: 12 August 2021

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/5540604

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Graphs with the second largest number of maximal independent sets
• Bounded size components -- partitions and transversals.
• Partitioning into graphs with only small components
• On conflict-free connection of graphs
• Bounded monochromatic components for random graphs
• Defective and clustered graph colouring
• On the maximum number of maximum independent sets
• Fragmentability of graphs
• Partitioning sparse graphs into an independent set and a graph with bounded size components
• (Strong) conflict-free connectivity: algorithm and complexity
• Clustered colouring in minor-closed classes
• Graph coloring with no large monochromatic components
• The structure and maximum number of maximum independent sets in trees
• New upper bounds on harmonious colorings
• Maximum value of conflict-free vertex-connection number of graphs
• Conflict-free (vertex)-connection numbers of graphs with small diameters
• On subgraphs without large components
• Islands in Graphs on Surfaces
• The number of maximum independent sets in graphs

This page was built for publication: On the \(k\)-component independence number of a tree