Graphs with unique maximum independent sets
From MaRDI portal
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.
Recommendations
- On unique independent sets in graphs
- Graphs with a unique maximum independent set up to automorphisms
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
- On perfect and unique maximum independent sets in graphs.
- Maximal k-independent sets in graphs
- On the number of maximum independent sets of graphs
- The number of maximum independent sets in graphs
- Maximum graphs with a unique minimum dominating set
- scientific article; zbMATH DE number 3882467
- Maximal independent sets in graphs with at most one cycle
Cites work
Cited in
(36)- The number of maximal independent sets in connected triangle-free graphs
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
- On unique independent sets in graphs
- On the independence graph of a graph
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
- Maximum graphs with a unique minimum dominating set
- Trees with a given number of leaves and the maximal number of maximum independent sets
- Independence equivalence classes of paths
- On independent cliques and linear complementarity problems
- Graphs with a unique maximum independent set up to automorphisms
- Graphs with unique maximum packing of closed neighborhoods
- Some more updates on an annihilation number conjecture: pros and cons
- A note on graphs contraction-critical with respect to independence number
- Unique irredundance, domination and independent domination in graphs
- On unique independence weighted graphs
- scientific article; zbMATH DE number 4132180 (Why is no real title available?)
- On perfect and unique maximum independent sets in graphs.
- scientific article; zbMATH DE number 4041970 (Why is no real title available?)
- Constraints on the number of maximal independent sets in graphs
- scientific article; zbMATH DE number 2061810 (Why is no real title available?)
- Independent sets in graphs
- Trees with a unique maximum independent set and their linear properties
- On the number of maximum independent sets of graphs
- Some bounds on the size of maximum G-free sets in graphs
- On local maximum stable set greedoids
- Graphs with odd and even distances between non-cut vertices
- On the core-nilpotent decomposition of unicyclic graphs
- Graphs with parity conditions on distances between cut and noncut vertices
- Graphs whose vertex independence number is unaffected by single edge addition or deletion
- More on independent transversal domination
- The complexity of pre-assignment problem for unique minimum vertex cover on bipartite graphs
- Graphs with unique Grundy dominating sets
- Null decomposition and a combinatorial-block generalized inversion of trees
- The number of maximum dissociation sets in trees
- The intersection of all maximum stable sets of a tree and its pendant vertices
- Graphs with the second largest number of maximal independent sets
This page was built for publication: Graphs with unique maximum independent sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069954)