节点文献
积图的独立数和上无赘数
Independence Number and Upper Irredundence Number of Product of Graphs
【摘要】 证明任意两个图G和H的积图G×H的独立数不小于这两个图的独立数之积,即β(G×H)≥β(G)×β(H);任意两个图G和H的积图G×H的上无赘数不小于这两个图的上无赘数之积,即IR(G×H)≥IR(G)×IR(H).
【Abstract】 It is proved that for any graphs G and H, independence number of product of graphs is greater than or equal to product of β(G) and β(H),i.e.β(G×H)≥β(G)×β(H),and that for any graphs and ,upper irredundence number of product of graphs is greater than or equal to product of IR(G) and IR(H),i.e.IR(G×H)≥IR(G)×IR(H) .
【关键词】 积图;
独立集;
无赘集;
私邻点;
【Key words】 product of graphs; independent set; irredundant set; private neighbor vertex;
【Key words】 product of graphs; independent set; irredundant set; private neighbor vertex;
- 【文献出处】 湖北民族学院学报(自然科学版) ,Journal of Hubei Institute For Nationalities , 编辑部邮箱 ,2004年04期
- 【分类号】O157.5
- 【下载频次】29