论文标题
最大总独立集的结构
Structure of a Maximal Total Independent Set
论文作者
论文摘要
让$ g $成为一个简单，连接和有限的图形，并带有订单$ n $。分别表示独立数量，边缘独立数量和总独立性数字，分别为$α（g），α'（g）$和$α”（g）$。本文建立了与$α$之间的关系。它还描述了给定尺寸的总独立集的可能结构。
Let $G$ be a simple, connected and finite graph with order $n$. Denote the independence number, edge independence number and total independence number by $α(G), α'(G)$ and $α"(G)$ respectively. This paper establishes a relation between $α"(G)$ with $α(G)$, $α'(G)$ and $n$. It also describes the possible structures of a total independent set of a given size.
