Smallest maximal matchings of graphs

Tavakoli, Mostofa; Došlić, Tomislav

doi:10.15672/hujms.1095437

prikaz prve stranice dokumenta Smallest maximal matchings of graphs

Preuzmi
PDF 234.64 KB

Znanstveni rad - Izvorni znanstveni rad

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

Citirajte ovaj rad

APA 6th Edition

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

MLA 8th Edition

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

Chicago 17th Edition

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

Harvard

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

Vancouver

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

IEEE

M. Tavakoli i T. Došlić, "Smallest maximal matchings of graphs", Hacettepe Journal of Mathematics and Statistics, vol. 52, br. 2, str. 356-366, 2023. [Online]. Dostupno na: https://urn.nsk.hr/urn:nbn:hr:237:584914. [Citirano: 06.12.2024.]

Za citiranje koristite ovu mrežnu adresu: https://urn.nsk.hr/urn:nbn:hr:237:584914

Prijavite se u repozitorij kako biste mogli spremiti objekt u svoju listu.

Podaci o radu

Naslov (engleski)	Smallest maximal matchings of graphs
Autor	Mostofa Tavakoli
Autor	Tomislav Došlić
Autorova ustanova	Sveučilište u Zagrebu Građevinski fakultet
Znanstveno / umjetničko područje, polje i grana	PRIRODNE ZNANOSTI Matematika
Sažetak (engleski)	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 Δ.
Ključne riječi (engleski)
Jezik	engleski
Vrsta publikacije	Znanstveni rad - Izvorni znanstveni rad
Status objave	Objavljen
Vrsta recenzije	Recenziran - međunarodna recenzija
Verzija publikacije	Objavljena verzija rada (izdavačev PDF)
Naslov časopisa	Hacettepe Journal of Mathematics and Statistics
Brojčani podaci	vol. 52, br. 2, str. 356-366
e-ISSN	2651-477X
DOI	https://doi.org/10.15672/hujms.1095437
URN:NBN	urn:nbn:hr:237:584914
Datum objave publikacije	2023
Vrsta resursa	Tekst
Prava pristupa	Otvoreni pristup
Uvjeti korištenja
Datum i vrijeme pohrane	2024-09-05 07:12:59