On the forcing matching numbers of prisms of graphs

DOI10.1016/j.disc.2021.112756zbMath1482.05276OpenAlexW4200015354MaRDI QIDQ2075509

Ali Mohammadian

Publication date: 14 February 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112756

zbMATH Keywords

prismhypercubeperfect matchinginvolutory matrixforcing matching number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Complete forcing numbers of hexagonal systems. II ⋮ Complete forcing numbers of complete and almost-complete multipartite graphs

Cites Work

• Unnamed Item
• Eight octads suffice
• The minimum forcing number for the torus and hypercube
• Forcing matchings on square grids
• Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
• The minimum forcing number of perfect matchings in the hypercube
• On unit weighing matrices with small weight
• Unitary signings and induced subgraphs of Cayley graphs of $\mathbb{Z}_2^{n}$

This page was built for publication: On the forcing matching numbers of prisms of graphs