Journal of Korean Institute of Industrial Engineers (대한산업공학회지)
- Volume 20 Issue 4
- /
- Pages.65-72
- /
- 1994
- /
- 1225-0988(pISSN)
- /
- 2234-6457(eISSN)
The Number of Maximal Independent sets of the Graph with joining Moon-Moser Graph and Complete Graph
Moon-Moser 그래프와 완전그래프를 결합한 그래프의 극대독립집합의 개수
Abstract
An independent set of nodes is a set of nodes no two of which are joined by an edge. An independent set is called maximal if no more nodes can be added to the set without destroying its independence. The greatest number of maximal independent set is the maximum possible number of maximal independent set of a graph. We consider the greatest number of maximal independent set in connected graphs with fixed numbers of edges and nodes. For arbitrary number of nodes with a certain class of number of edges, we present the connected graphs with the greatest number of maximal independent set. For a given class of number of edges, the structure of graphs with the greatest number of maximal independent set is that the two components are completely joined; one consists of disjoint triangles as many as possible and the other is the complete graph with remaining nodes.
Keywords