摘要
图G的导出匹配划分数是图论中研究的热点问题.针对乘积图的导出匹配划分数进行了研究,给出了乘积图的导出匹配划分数的一个下界和一个上界,对一些特殊图类的乘积图,还给出了其导出匹配划分数的精确结果,可为相关研究参考.
The induced matching partition number of graph G is an important problem for graph theory.The induced matching partition number of product graphs was studied,a lower bound and an upper bound for the induced matching partition number of product graphs were given,and exact results are given for some special product graphs.These provid some references for similar studies.
出处
《华北水利水电学院学报》
2009年第5期100-102,共3页
North China Institute of Water Conservancy and Hydroelectric Power
基金
河南省重点科技攻关项目(072102340009)
河南省哲学社会科学规划项目(2007BJJ014)
河南省科技厅软科学研究计划项目(08240044010)
河南省教育厅自然科学基础研究计划项目(2009A110011)
关键词
导出匹配
划分
着色
乘积图
induced matching
partition
coloring
product graph
