prikaz prve stranice dokumenta Smallest maximal matchings of graphs
  Download
PDF 234.64 KB
Scientific paper - Original scientific paper
Smallest maximal matchings of graphs
Hacettepe Journal of Mathematics and Statistics, 52 (2023), 2; 356-366. https://doi.org/10.15672/hujms.1095437
Tavakoli, Mostofa; Došlić, Tomislav

Institutional repository: Repository of the Faculty of Civil Engineering, University of Zagreb

Cite this document

Tavakoli, M. & Došlić, T. (2023). Smallest maximal matchings of graphs. Hacettepe Journal of Mathematics and Statistics, 52. (2), 356-366. doi: 10.15672/hujms.1095437

Tavakoli, Mostofa and Tomislav Došlić. "Smallest maximal matchings of graphs." Hacettepe Journal of Mathematics and Statistics, vol. 52, no. 2, 2023, pp. 356-366. https://doi.org/10.15672/hujms.1095437

Tavakoli, Mostofa and Tomislav Došlić. "Smallest maximal matchings of graphs." Hacettepe Journal of Mathematics and Statistics 52, no. 2 (2023): 356-366. https://doi.org/10.15672/hujms.1095437

Tavakoli, M. and Došlić, T. (2023) 'Smallest maximal matchings of graphs', Hacettepe Journal of Mathematics and Statistics, 52(2), pp. 356-366. doi: 10.15672/hujms.1095437

Tavakoli M, Došlić T. Smallest maximal matchings of graphs. Hacettepe Journal of Mathematics and Statistics [Internet]. 2023 [cited 2024 December 27];52(2):356-366. doi: 10.15672/hujms.1095437

M. Tavakoli and T. Došlić, "Smallest maximal matchings of graphs", Hacettepe Journal of Mathematics and Statistics, vol. 52, no. 2, pp. 356-366, 2023. [Online]. Available at: https://urn.nsk.hr/urn:nbn:hr:237:584914. [Accessed: 27 December 2024]

Metadata
Title (english)Smallest maximal matchings of graphs
AuthorMostofa Tavakoli
AuthorTomislav Došlić
Author's institutionUniversity of Zagreb
Faculty of Civil Engineering
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract (english)
Let G = (VG,EG) be a simple and connected graph. A set M ⊆ EG is called a matching of G if no two edges of M are adjacent. The number of edges in M is called its size. A matching M is maximal if it cannot be extended to a larger matching in G. The smallest size of a maximal matching is called the saturation number of G. In this paper we are concerned with the saturation numbers of lexicographic product of graphs. We also address and solve an open problem about the size of maximum matchings in graphs with a given maximum degree Δ.
Keywords (english)
Languageenglish
Publication typeScientific paper - Original scientific paper
Publication statusPublished
Peer reviewPeer review - international
Publication versionPublished version
Journal titleHacettepe Journal of Mathematics and Statistics
Numberingvol. 52, no. 2, pp. 356-366
e-ISSN2651-477X
DOIhttps://doi.org/10.15672/hujms.1095437
URN:NBNurn:nbn:hr:237:584914
Publication2023
Type of resourceText
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2024-09-05 07:12:59