导出子图中不含K4-e的无爪立方图的完美匹配个数
Number of Perfect Matchings of Claw-free Cubic Graphs without K4-e as Its Induced Subgraphs
-
摘要: 设G是一个简单图,具有顶点集合V（G）和边集合E（G）。若图G的任意导出子图都不与K1,3同构,则称G是一个无爪图。一个立方图是一个所有顶点都是三度点的图。本文给出了一类特殊图——不含K4-e的无爪立方图的完美匹配计数。 更多还原Abstract: Let G be a simple graph with vertex set V（G） and edge set E（G）.A graph G is said to be claw-free if G does not contain any induced subgraph isomorphic to K1,3.A cubic graph is a graph,each vertex of which has degree three.The perfect matching number of claw-free cubic graphs without K4-e as its induced subgraphs is characterized.
下载: