Title : ( Global forcing number for maximal matchings in corona products )
Authors: Sandi Klavzar , Mostafa Tavakoli , gholamreza abrishamimoghadam ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
A global forcing set for maximal matchings of a graph G = (V (G), E(G)) is a set S ⊆ E(G) such that M1 ∩S = M2 ∩S for each pair of maximal matchings M1 and M2 of G. The smallest such set is called a minimum global forcing set, its size being the global forcing number for maximal matchings φ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
Keywords
, Maximal matching, Perfect matching, Global forcing number, Corona product, Integer linear programming.
@article{paperid:1088394,
author = {Sandi Klavzar and Tavakoli, Mostafa and Abrishamimoghadam, Gholamreza},
title = {Global forcing number for maximal matchings in corona products},
journal = {Aequationes Mathematicae},
year = {2022},
volume = {96},
number = {5},
month = {October},
issn = {0001-9054},
pages = {997--1005},
numpages = {8},
keywords = {Maximal matching; Perfect matching; Global forcing number; Corona product;
Integer linear programming.},
}
%0 Journal Article
%T Global forcing number for maximal matchings in corona products
%A Sandi Klavzar
%A Tavakoli, Mostafa
%A Abrishamimoghadam, Gholamreza
%J Aequationes Mathematicae
%@ 0001-9054
%D 2022
