induced subgraph 中文意思是什麼

induced subgraph 解釋
誘導子圖, 導齣子圖
  1. 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 , 。同構的導齣子圖的圖
  2. A color a e x is legal for an uncolored vertex v e v if by coloring v with a, the subgraph induced by all vertices of color a has maximum degree at most d

    對頂點v是合法的,是指由所有染顏色。的頂點導出的子圖的最大度至多是d ,其中alice和bob每走一步都是用合法顏色染未染色點。
  3. 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度頂點叫該爪的爪心
  4. 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受限圖
分享友人