On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number
From MaRDI portal
Publication:6178795
Recommendations
- The maximum number of maximum dissociation sets in trees
- Maximal and maximum dissociation sets in general and triangle-free graphs
- A bound on the dissociation number
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
- Complexity of dissociate set problems in some hereditary classes of graphs
Cites work
- scientific article; zbMATH DE number 5995277 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 2192124 (Why is no real title available?)
- scientific article; zbMATH DE number 6257565 (Why is no real title available?)
- An improved algorithm for the vertex cover \(P_3\) problem on graphs of bounded treewidth
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Graphs with the second largest number of maximal independent sets
- Independent packings in structured graphs
- Maximal and maximum independent sets in graphs with at mostr cycles
- Maximal independent sets in bipartite graphs
- Maximal independent sets in caterpillar graphs
- Maximal independent sets in graphs with at mostr cycles
- Maximal independent sets in minimum colorings
- Maximizing the number of independent sets of fixed size in connected graphs with given independence number
- Minimum \(k\)-path vertex cover
- NP-hard graph problems and boundary classes of graphs
- Node-Deletion Problems on Bipartite Graphs
- On cliques in graphs
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- On graphs with the third largest number of maximal independent sets
- On the maximum number of maximum independent sets
- On the maximum number of maximum independent sets in connected graphs
- On the maximum number of minimum dominating sets in forests
- The complexity of dissociation set problems in graphs
- The complexity of restricted spanning tree problems
- The maximum number of maximum dissociation sets in trees
- The number of maximum independent sets in graphs
- The structure and maximum number of maximum independent sets in trees
- Trees with the second and third largest number of maximal independent sets
- Trees with the second largest number of maximal independent sets
Cited in
(11)- The maximum number of maximum dissociation sets in trees
- Maximum dissociation sets in subcubic trees
- Enumerating maximal dissociation sets in three classes of grid graphs
- A bound on the dissociation number
- Maximal and maximum dissociation sets in general and triangle-free graphs
- Extremal vertex-degree function index with given order and dissociation number
- On spectral extrema of graphs with given order and dissociation number
- Minimum number of maximal dissociation sets in trees
- On the maximum number of maximum dissociation sets in trees with given dissociation number
- On the \(A_\alpha\)-index of graphs with given order and dissociation number
- Uniformly dissociated graphs
This page was built for publication: On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178795)
