<technical report>
On Maximum Uniform Partition of Line Graphs

Creator
Language
Publisher
Date
Source Title
Vol
Publication Type
Access Rights
Related DOI
Related URI
Relation
Abstract 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 when 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.show more

Hide fulltext details.

pdf rifis-tr-32 pdf 175 KB 279  

Details

Record ID
Peer-Reviewed
Subject Terms
Type
Created Date 2009.04.22
Modified Date 2021.12.13

People who viewed this item also viewed