On unique independent sets in graphs
From MaRDI portal
Publication:1331985
DOI10.1016/0012-365X(94)90389-1zbMATH Open0812.05035MaRDI QIDQ1331985FDOQ1331985
Lutz Volkmann, Jerzy Topp, Werner Siemes
Publication date: 27 September 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
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 (6)
- 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
- Graphs with unique maximum independent sets
- On independent cliques and linear complementarity problems
Recommendations
- Title not available (Why is that?) π π
- A finiteness theorem for maximal independent sets π π
- On graphs having maximal independent sets of exactly \(t\) distinct cardinalities π π
- Fourier analysis and large independent sets in powers of complete graphs π π
- Graphs with unique maximum independent sets π π
- On \(k\)-independence in graphs with emphasis on trees π π
- The number of maximum independent sets in graphs π π
- Estimates of the number of independent sets in graphs with a fixed independence number π π
- Maximal k-independent sets in graphs π π
- Trees with the second and third largest number of maximum independent sets. π π
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)