Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers

DOI10.1007/978-3-319-31584-3_18zbMath1360.92138OpenAlexW2508852440MaRDI QIDQ2980027

Nasrin Kahkeshani, Gholam Hasan Shirdel

Publication date: 27 April 2017

Published in: Distance, Symmetry, and Topology in Carbon Nanomaterials (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31584-3_18

zbMATH Keywords

weighted graphdendrimersmatching interdiction problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• The most vital nodes with respect to independent set and vertex cover
• Matching interdiction
• The multi-terminal maximum-flow network-interdiction problem
• Most vital links and nodes in weighted networks
• Deterministic network interdiction
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• Finding the n Most Vital Links in Flow Networks
• Shortest-path network interdiction
• Optimal interdiction of a supply network

This page was built for publication: Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers