数学季刊 ›› 1996, Vol. 11 ›› Issue (1): 107-110.

• • 上一篇    

The   Minimum   Fill-in    for   the   Corona   of   Two    Graphs

  

  1. Henan   University, Kaifeng.China,475001


  • 收稿日期:1994-01-07 出版日期:1996-03-30 发布日期:2025-02-27

The   Minimum   Fill-in    for   the   Corona   of   Two    Graphs

  1. Henan   University, Kaifeng.China,475001
  • Received:1994-01-07 Online:1996-03-30 Published:2025-02-27

摘要: In this paper,we determine the minimum fill-ins of the coronaG·H of two graphs G and H when the minimum fill-in of 

关键词: G.H wegraph, labelling, minimum fill-in

Abstract: In this paper,we determine the minimum fill-ins of the coronaG·H of two graphs G and H when the minimum fill-in of 

Key words: G.H wegraph, labelling, minimum fill-in

中图分类号: