On disjoint maximum and maximal independent sets in graphs and inverse independence number

DOI10.1142/s1793830922501658zbMath1524.05216OpenAlexW4297060651MaRDI QIDQ6059087

Unnamed Author

Publication date: 2 November 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922501658

zbMATH Keywords

independence numberindependent setCartesian productrooted productinverse independence number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On disjoint maximal independent sets in graphs
• Notes on the independence number in the Cartesian product of graphs
• Domination-related parameters in rooted product graphs

This page was built for publication: On disjoint maximum and maximal independent sets in graphs and inverse independence number