典型文献
PM-compact Graphs and Vertex-deleted Subgraphs
文献摘要：
The perfect matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings of G.A graph G is PM-compact if the 1-skeleton graph of the prefect matching polytope of G is complete.Equivalently,a matchable graph G is PM-compact if and only if for each even cycle C of G,G-V(C)has at most one perfect matching.This paper considers the class of graphs from which deleting any two adjacent vertices or nonadjacent vertices,respectively,the resulting graph has a unique perfect matching.The PM-compact graphs in this class of graphs are presented.
文献关键词：
中图分类号：
作者姓名：
Yi-pei ZHANG;Xiu-mei WANG;Jin-jiang YUAN
作者机构：
School of Mathematics and Statistics,Zhengzhou University,Zhengzhou 450001,China
文献出处：
引用格式：
[1]Yi-pei ZHANG;Xiu-mei WANG;Jin-jiang YUAN-.PM-compact Graphs and Vertex-deleted Subgraphs)[J].应用数学学报（英文版）,2022(04):955-965
A类：
Subgraphs,prefect,Equivalently,matchable,nonadjacent
B类：
PM,compact,Graphs,Vertex,deleted,perfect,polytope,convex,hull,incidence,vectors,all,matchings,if,skeleton,complete,only,each,even,cycle,has,most,one,This,paper,considers,class,from,which,deleting,any,two,vertices,respectively,resulting,unique,this,are,presented
AB值：
0.436731
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
