Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
From MaRDI portal
Recommendations
- Molecular graphs and the inverse Wiener index problem
- scientific article; zbMATH DE number 1890107
- scientific article; zbMATH DE number 434899
- Extremal matching energy of molecular graphs with given matching number two
- On the rigidity of molecular graphs
- The matching interdiction problem in dendrimers
- scientific article; zbMATH DE number 4081609
- Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs
- scientific article; zbMATH DE number 1890104
- On a method for ordering the vertices of molecular graphs
Cites work
- Deterministic network interdiction
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Finding the n Most Vital Links in Flow Networks
- Matching interdiction
- Most vital links and nodes in weighted networks
- On the number of matchings and independent sets in \((3,6)\)-fullerenes
- Optimal interdiction of a supply network
- Shortest-path network interdiction
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The most vital nodes with respect to independent set and vertex cover
- The multi-terminal maximum-flow network-interdiction problem
Cited in
(4)
This page was built for publication: Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980027)