The Number of 2-matchings and Distinct 4-cycles in a Hyperoctahedral Graph

スポンサーリンク

概要

• 論文の詳細を見る

• We study the number of 2-matchings and distinct 4-cycles in a hyperoctahedral graph through coefficients of the characteristic polynomial. Also, we consider the chromatic number and the edge chromatic number of a hyperoctahedral graph.

• 中部大学の論文

著者

• Kanematsu Mitsuo

  Department Of Childhood Education College Of Contemporary Education

• Kanemitsu Mitsuo

  Department of Childhood Education, College of Contemporary Education

関連論文

• Intergral closedness in finitely generated ring-extensions of Noetherian domains
• THE LAURENT EXTENSION OF A NOETHERIAN INTEGRAL DOMAIN
• Some theorems concerning anti-integral,super-primitive and ultra-primitive elements
• On Some results Deduced From the Equality R[1/α]=R[(1/α-α)]
• The prime divisors in the product of ideals
• ON THE DETERMINATION OF THE PRIME DIVISORS IN SIMPLE RING EXTENSIONS
• The Number of 2-matchings and Distinct 4-cycles in a Hyperoctahedral Graph

スポンサーリンク