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), \alpha'(G)$ and $\alpha''(G)$ respectively. This paper establishes an upper bound for $\alpha''(G)$ in terms of $\alpha(G)$, $\alpha'(G)$ and $n$. We also describe the possible structures for a total independent set containing a given number of elements.
"Structure of a Total Independent Set,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 24:
2, Article 8.
Available at: https://scholar.rose-hulman.edu/rhumj/vol24/iss2/8