Graphs with unique maximum independent sets (Q1069954): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q215558 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Peter Horák / rank | |||
Normal rank |
Revision as of 03:10, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graphs with unique maximum independent sets |
scientific article |
Statements
Graphs with unique maximum independent sets (English)
0 references
1985
0 references
A graph is a unique independence graph if it has a unique independent set of vertices of maximal cardinality. If, moreover, the complement of the set of vertices is also independent, the graph is called a strong unique independence graph. The authors prove the following theorem: A connected graph is a strong unique independence graph if and only if it is bipartite and has a spanning tree in which the distance between any two end vertices is even. Further, a characterization of unique independence trees is given.
0 references
unique independence graph
0 references
independent set of vertices
0 references
strong unique independence graph
0 references