TY - JOUR
T1 - On König–Egerváry corona graphs
AU - Levit, Vadim E.
AU - Mandrescu, Eugen
N1 - Publisher Copyright:
© The Author(s) 2025.
PY - 2025/11
Y1 - 2025/11
N2 - Let α(G) denote the cardinality of a maximum independent set and μ(G) be the size of a maximum matching of a graph G=VG,EG. If α(G)+μ(G)=VG-k, then G is a k -König–Egerváry graph. In particular, if k=0, then G is a König–Egerváry graph. The coronaH∘X of a graph H and a family of graphs X=Xi:1≤i≤V(H) is obtained by joining each vertex vi of H to all the vertices of the corresponding graph Xi,i=1,2,..,V(H). In this paper we completely characterize graphs whose coronas are k-König–Egerváry graphs, where k∈0,1.
AB - Let α(G) denote the cardinality of a maximum independent set and μ(G) be the size of a maximum matching of a graph G=VG,EG. If α(G)+μ(G)=VG-k, then G is a k -König–Egerváry graph. In particular, if k=0, then G is a König–Egerváry graph. The coronaH∘X of a graph H and a family of graphs X=Xi:1≤i≤V(H) is obtained by joining each vertex vi of H to all the vertices of the corresponding graph Xi,i=1,2,..,V(H). In this paper we completely characterize graphs whose coronas are k-König–Egerváry graphs, where k∈0,1.
KW - 1-König–Egerváry graph
KW - Corona of graphs
KW - König–Egerváry graph
KW - Maximum independent set
KW - Maximum matching
UR - https://www.scopus.com/pages/publications/105013892279
U2 - 10.1007/s40590-025-00796-8
DO - 10.1007/s40590-025-00796-8
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:105013892279
SN - 1405-213X
VL - 31
JO - Boletin de la Sociedad Matematica Mexicana
JF - Boletin de la Sociedad Matematica Mexicana
IS - 3
M1 - 110
ER -