Structure of a Maximal Total Independent Set

arXiv2206.04395MaRDI QIDQ6401567FDOQ6401567

Authors: Lewis Stanton 

Publication date: 9 June 2022

Abstract: Let $G$ be a simple, connected and finite graph with order $n$. Denote the independence number, edge independence number and total independence number by $alpha(G),alph{a}^{\prime }(G)$ and $$ respectively. This paper establishes a relation between $$ with $alpha(G)$, $alph{a}^{\prime }(G)$ and $n$. It also describes the possible structures of a total independent set of a given size.

Recommendations

• On the number of maximum independent sets of graphs
• The number of maximal independent sets in connected graphs
• scientific article; zbMATH DE number 38156
• The number of maximum independent sets in graphs
• On the third largest number of maximal independent sets of graphs

Mathematics Subject Classification ID

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

This page was built for publication: Structure of a Maximal Total Independent Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401567)