典型文献
Induced Matching-Extendability of Halin Graphs
文献摘要：
Let G be a connected graph having a perfect matching.The graph G is said to be induced matching(IM)extendable if every induced matching M of G is contained in a perfect matching of G.In this paper,we show that Halin graph G=T∪C is IM-extendable if and only if its characteristic tree T is isomorphic to K1,3,K1,5,K1,7 or S2,2.
文献关键词：
中图分类号：
作者姓名：
ZHANG Qing-nan;HUI Zhi-hao;YANG Yu;WANG An
作者机构：
School of Mathematics and Statistics,Pingdingshan University,Pingdingshan 467000,China;International Joint Laboratory for Multidimensional Topology and Carcinogenic Characteristics Analysis of Atmospheric Particulate Matter PM2.5,Pingdingshan 467000,China;School of Software,Pingdingshan University,Pingdingshan 467000,China
文献出处：
引用格式：
[1]ZHANG Qing-nan;HUI Zhi-hao;YANG Yu;WANG An-.Induced Matching-Extendability of Halin Graphs)[J].数学季刊（英文版）,2022(04):380-385
A类：
Extendability,Halin
B类：
Induced,Matching,Graphs,Let,be,connected,graph,having,perfect,matching,said,induced,IM,extendable,if,every,contained,this,paper,we,show,that,only,its,characteristic,tree,isomorphic,K1,S2
AB值：
0.516444
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
