Fractional forcing number of graphs

DOI10.1016/J.DISC.2025.114739MaRDI QIDQ6884414zbMATH OpenFDO

Authors J. B. Ebrahimi, Babak Ghanbari

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114739

zbMATH Keywords

forcing numberfractional forcing numberfractional graph theoryfractional perfect matchingperfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites work

• Anti-forcing numbers of perfect matchings of graphs
• Anti-forcing polynomials for benzenoid systems with forcing edges
• Anti-forcing spectra of perfect matchings of graphs
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• Bounds on the forcing numbers of bipartite graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Complete forcing numbers of graphs
• Complete forcing numbers of hexagonal systems
• Components of domino tilings under flips in quadriculated tori
• Components of flip graphs of domino tilings in quadriculated cylinder and torus
• Continuous forcing spectra of even polygonal chains
• Extremal anti-forcing numbers of perfect matchings of graphs
• Forcing and anti-forcing edges in bipartite graphs
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
• Forcing bonds of a benzenoid system
• Forcing matching numbers of fullerene graphs
• Forcing matchings on square grids
• Forcing numbers of stop signs.
• Forcing polynomials of benzenoid parallelogram and its related benzenoids
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• Global forcing number of benzenoid graphs
• Global forcing number of some chemical graphs
• Hexagonal systems with forcing edges
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 790414 (Why is no real title available?)
• scientific article; zbMATH DE number 6127683 (Why is no real title available?)
• Maximum forcing number of hexagonal systems
• Maximum matching and a polyhedron with 0,1-vertices
• Minimalstellen von Funktionen und Extremalpunkte
• On forcing matching number of boron-nitrogen fullerene graphs
• On the anti-forcing number of benzenoids
• On the anti-forcing number of fullerene graphs
• On the anti-Kekulé and anti-forcing number of cata-condensed phenylenes
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• On the forced matching numbers of bipartite graphs
• On the global forcing number of hexagonal systems
• On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes
• On the spectrum of the forced matching number of graphs
• On the total forcing number of a graph
• The anti-forcing number of double hexagonal chains
• The anti-forcing number of hexagonal chains
• The forcing number of toroidal polyhexes
• The forcing polynomial of catacondensed hexagonal systems
• The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
• The minimum forcing number for the torus and hypercube
• The minimum forcing number of perfect matchings in the hypercube
• Tight upper bound on the maximum anti-forcing numbers of graphs

Cited in

(1)

• Bounds on the complete forcing numbers of graphs

This page was built for publication: Fractional forcing number of graphs

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