Anti-forcing number of some specific graphs

DOI10.22052/IJMC.2017.60978.1235MaRDI QIDQ4617716zbMATH OpenOpenAlexFDO

Authors Saeid Alikhani, Neda Soltani

Publication date 7 February 2019

Full work available at URL https://ijmc.kashanu.ac.ir/article_49785_5762b32f4d73311e1b30d195fe19f9ba.pdf

zbMATH Keywords

anti-forcing numberanti-forcing setcorona product

Mathematics Subject Classification ID

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

Recommendations

• Anti-forcing numbers of perfect matchings of graphs
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• The anti-forcing number of hexagonal chains
• The anti-forcing number of double hexagonal chains
• Extremal anti-forcing numbers of perfect matchings of graphs

Cites work

• Anti-forcing numbers of perfect matchings of graphs
• Computing the Hosoya polynomial of graphs from primary subgraphs
• Forcing matching numbers of fullerene graphs
• Matching theory
• On the anti-forcing number of benzenoids
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids

Cited in

(11)

• Forcing and anti-forcing edges in bipartite graphs
• The anti-forcing number of double hexagonal chains
• Graphs where each spanning tree has a perfect matching
• Tight upper bound on the maximum anti-forcing numbers of graphs
• On the anti-Kekulé and anti-forcing number of cata-condensed phenylenes
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• The anti-forcing number of hexagonal chains
• Anti-forcing numbers of perfect matchings of graphs
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• On the anti-forcing number of graph powers
• The anti-Kekulé number of graphs

This page was built for publication: Anti-forcing number of some specific graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4617716)