＜テクニカルレポート＞On Maximum Uniform Partition of Line Graphs

作成者 作成者姓名 所属機関 所属機関名 Department of Applied Mathematics Fukuoka University 福岡大学理学部応用数学科 英語 Research Institute of Fundamental Information Science, Kyushu University 九州大学理学部附属基礎情報学研究施設 1990-10-22 32 accepted open access We show that (A) If G = (V, E) is an Euler circuit, then the number of the maximum uniform partition of the line graph L(G) is (1/4) $Sigma _ upsilon \varepsilon \ u d^2_\ u$ (-l)(-1 is added whe...n mid E mid is odd), where $d_nu$, is the degree of v. (B) If G is not an Euler circuit, then the number of the maximum uniform partition of L(G) is (1/4) $Sigma _ upsilon \varepsilon \ u d^2_\ u - iota$, where $iota$ is the number of vertices of odd degree.続きを見る

本文情報を非表示

rifis-tr-32 pdf 175 KB 62

詳細

レコードID 3140 査読無 RIFIS Technical Report || 32 || p1-3 http://www.i.kyushu-u.ac.jp/research/report.html maximum uniform partition line graph Euler tour technique テクニカルレポート 2009.04.22 2017.01.20