In this paper, we determine the minimum fill-ins of the corona G. H of two graphs G and H when the minimum fill-in of G,H were known as F(G),F(H). Our result is that
文摘In this paper, we determine the minimum fill-ins of the corona G. H of two graphs G and H when the minimum fill-in of G,H were known as F(G),F(H). Our result is that