On unique independent sets in graphs
From MaRDI portal
Publication:1331985
DOI10.1016/0012-365X(94)90389-1zbMATH Open0812.05035MaRDI QIDQ1331985FDOQ1331985
Authors: Werner Siemes, Jerzy Topp, Lutz Volkmann 
Publication date: 27 September 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- On \(k\)-independence in graphs with emphasis on trees
- Graphs with unique maximum independent sets
- Trees with the second and third largest number of maximum independent sets.
- Estimates of the number of independent sets in graphs with a fixed independence number
- On graphs having maximal independent sets of exactly \(t\) distinct cardinalities
- Fourier analysis and large independent sets in powers of complete graphs
- Maximal k-independent sets in graphs
- The number of maximum independent sets in graphs
- Publication:4486258
- A finiteness theorem for maximal independent sets
Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (9)
- On perfect and unique maximum independent sets in graphs.
- Graphs with a unique maximum independent set up to automorphisms
- Unique minimum semipaired dominating sets in trees
- Unique irredundance, domination and independent domination in graphs
- On local maximum stable set greedoids
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
- Title not available (Why is that?)
- Graphs with unique maximum independent sets
- On independent cliques and linear complementarity problems
This page was built for publication: On unique independent sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1331985)
