Global forcing number for maximal matchings in corona products

DOI10.1007/S00010-022-00869-3MaRDI QIDQ2172838zbMATH OpenOpenAlexFDO

Authors Sandi Klavžar, M. Tavakoli, G. Abrishami

Publication date 16 September 2022

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2107.13786

zbMATH Keywords

corona productglobal forcing numberinteger linear programmingmaximal matchingperfect matching

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) Linear programming (90C05) Integer programming (90C10)

Abstract: A global forcing set for maximal matchings of a graph $G=(V(G),E(G))$ is a set $SsubseteqE(G)$ such that $M_{1}capSeq{M}_{2}capS$ for each pair of maximal matchings $M_1$ and $M_2$ of $G$. The smallest such set is called a minimum global forcing set, its size being the global forcing number for maximal matchings $ph{i}_{gm}(G)$ of $G$. In this paper, we establish lower and upper bounds on the forcing number for maximal matchings of the corona product of graphs. We also introduce an integer linear programming model for computing the forcing number for maximal matchings of graphs.

Recommendations

• Global forcing number for maximal matchings
• scientific article; zbMATH DE number 7339206
• Global forcing number of benzenoid graphs
• Complete forcing numbers of graphs
• On the global forcing number of hexagonal systems

Cites work

• r-dynamic coloring of the corona product of graphs
• Counting maximal matchings in linear polymers
• Dominated and dominator colorings over (edge) corona and hierarchical products
• Edge Dominating Sets in Graphs
• Edge metric dimensions via hierarchical product and integer linear programming
• Global forcing number for maximal matchings
• Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures
• Kekulé structures of honeycomb lattice on Klein bottle and Möbius strip
• Matching theory
• On Kekulé structures count
• On the anti-Kekulé number of (4, 5, 6)-fullerenes
• On the edge irregular reflexive labeling of corona product of graphs with path
• On the forced matching numbers of bipartite graphs
• Randomly matchable graphs
• Saturation number of nanotubes
• Small maximal matchings in random graphs.
• The global forcing number of the parallelogram polyhex
• The minimum forcing number of perfect matchings in the hypercube
• Tight bounds on maximal and maximum matchings

Cited in

(5)

• Global forcing number for maximal matchings
• Extremal graphs for average sizes of maximal matchings
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• Maker-breaker resolving game played on corona products of graphs
• Maker-Breaker domination game played on corona products of graphs

This page was built for publication: Global forcing number for maximal matchings in corona products

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