导出子图 meaning in Chinese

induced subgraph

A graph g is called k1 , 4 - free graph if g does not contain an induced subgraph that is isomorphic to k1 , 4
所谓凡；。 free图是指不含与k ，。同构的导出子图的图
Let h is a induced subgraph of g , we say h is a claw of g if h is isomorphic to k1 , 3 , and we call the three - degree vertices of g is claw - centers of this claw
图g中一个与k _ ( 1 , 3 )同构的导出子图叫g的一个爪爪中的3度顶点叫该爪的爪心
For all p - claws in g , if the subgraph induced by vertices whose degree in p - claw is one has at least ( p - 2 ) edges , then we call g a k1 , p - confined graph
如果g中的任一个p -爪中的1度顶点集合的导出子图中至少有卜2条边，则称g是klfp受限图
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removing the vertex subset from the graph
摘要若从一个图中去掉某些顶点后得到的导出子图是无圈图，则所去的那些顶点组成的集合就是原图的反馈点集。