Joumal of Mathematics Research Vol. 2, No.

2, May 2010

ISSN: 1916-9795 E-ISSN: 1916-9809

Tulgeity of Line Graphs

Akbar Ali.M.M (Corresponding author) Department of Mathematics Sri Shakthi Institute of Engineering and Technology Coimbatore 641 062, Tamil Nadu, India Tel: 91-999-427-9835 E-mail: um-akbar@yahoo.co.in

S.Panayappan Department of Mathematics, Govemment Arts College Coimbatore 641 018, Tamil Nadu, India Tel: 91-944-310-9345 E-mail: panayappan@gmail.com

Abstract Tulgeity T{G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. The formula for the tulgeity of the line graph of complete graph and complete bigraph are derived. Also we present an upperbound for the tulgeity of line graph of any graph and we classify the graph for which the upperbound becomes the formula. Keywords: Tulgeity, Line graph 1. Introduction Point partition number (Gray Chartrand, 1971) of a graph G is the minimum number of subsets into which the point-set of G can be partitioned so that the subgraph induced by each subset has property P. Dual to this concept of point partition number of graph is the maximum number of subsets into which the point-set of G can be partitioned such that the subgraph induced by each subset does not have the property P. Define the property P such that a graph G has the property P if G contains no subgraph which is homeomorphic from the complete graph ^^3. Now the point partition number and dual point partition number for the property P is refered to as point arboricity and tulgeity of G respectively. Equivalently the tulegity is the maximum number of vertex disjoint subgraphs contained in G so that each subgraph is not acyclic. This number is called the tulgeity of G denoted by T{G). Also, T(G) can be defined as the maximum number of vertex disjoint cycles in G. The formula for tulgeity of a complete bipartite graph is given in (Gray Chartrand., 1968). The problems of Nordhaus-Gaddum type for the dual point partition number are investigated in (Anton, 1990). All graphs considered in this paper are finite and contains no loops and no multiple edges. Denote by [x] the greatest integer less than or equal to x, by |51 the cardinality of the set S, by E{G) the edge set of G and by K the complete graph on n vertices. The other notations and terminology used in this paper can be found in (Frank Harary, 1969). Line graph of a graph G is defined with the vertex set E{G), in which two vertices are adjacent iff the corresponding edges are adjacent in G. Since T{G) < , it is obvious that T{L{G)) - . However for complete graph Kp, T(Kp) = r r .
L^J
L.JJ L.^J

2. Main Theorems We now present a formula to find tulgeity of line graph of a complete graph. Theorem 2.1. The tulgeity of line graph of complete graph Kn, Proof
Let V(A'n) = {vi,V2, ...,v)andletey be theedge joining the vertices V, and vy. i.e.,(ir) = {e,; : 1 <i<n, i+l < j < nj. "^"~^\ Clearly by the definition of line graph, V{L{Kn)) = E{Kn) = {e,-; : 1 < < n, / + 1 < 7 < n) and \V{L{Kn))\ =
T(L('))

The edges incident with the vertex v, in ^(1 < (' < n), form a clique (say K') of order (n - 1) in L{Kn). Hence L{Kn) contains n cliques K[,K'^,..., K' of order (n - 1). 146 www.ccsenet.org/jmr

ISSN: 1916-9795 E-ISSN: 1916-9809

Joumal of Mathematics Research Vol. 2, No. 2, May 2010

ViK\) = {eij : 2 < j < n]

ViK) = {ei4, e24, e34} U {e4j : 5 < j < n]

In general

ViK)

= (e,, : I < i < I-l]U

{eij : 1+I

< j < n]

C a s e i):n=

limod

3)

(n - 1) is a multiple of 3 and hence the order of each clique of LiK) is a mutiple of 3. In this case the disjoint cycles of LiKn) are counted as follows. Consider the following set of cycles of ATJ, A'j,..., K'n. Let Ci = [e\2e\-ieu,eiie\(,e\i,...,e^n-2)e\(n-\)e\n] and let V(Ci) be the set of vertices belonging to the cycles of C\. '^-^.

Clearly the cycles of Ci are disjoint and y(Ci) = ViK\). Also |Ci| =

Let C2 = {e25e26e2i,e2%e2ge2\o,...,e2(n-2)e2(n-i)e2n] and let VC2) be the set of vertices belonging to the cycles of C2. Clearly the cycles of C2 are disjoint and VC2) = ViK'^) - {^23, ^24, e^], where en e ViK[). Also IC2I = '^^-. Let C3 = {e35e36e37, e38e39e3io,...- e3(_2)e3(-i)e3) and let VC3) be the set of vertices belonging to the cycles of C3. The cycles of C3 are disjoint and VC3) = ViK^) - {^34,623,^14}, where ^23 e ViK'^) and e^ ViK[). Also IC3I = ^ ^ . Now the vertices 23. 24 and 634 form a 3-cycle in LiKn). Continuing this process we get IC4I = '^-^,
J

IC5I = ^^,
.3

ICfil = ^

, |C_5| = 1, |C_4| = 1, |C-3l = 1, |C-2l = O, |C_i| = o, \Cn\ = 0.

Let C+i be the set of cycles formed by the vertices of ViK) - ViV'.), (2 < / < n).
i.e., CH.i = < e,(,+i)e,(,+2)e(i.n){,+2) : / = 3fe - 1,1 <

n-l

Also|C+i| = ^.

Clearly all the cycles of Cl, C2,...,C+i are disjoint and hence the total number of cycles counted by n+l fi(fi _ I) ( _ I)

the above process is |C,| = -^^^. Hence riLiKn)) > -^ 6 6

Case (ii) : n = limod 3)

-.

in - 2) is a multiple of 3. In this case the disjoint cycles of LiKn) are counted as follows. Consider the following set of cycles of K\,K'.^,...,K'n. Let C, be the set of cycles of the clique K'. (1 < < n) and let V(C,) be the set of vertices belonging to the cycles of C,. Let C| = {ei3ei4ei5,ei6ei7ei8,...,ei(_2)ei(_i)ei|, where V(Ci) = ViK[)Let C2 = 1^23624^25. C26e27e28>.... e2(n-2)e2(n-i)e2nl. where Let C3 = {36E37^38. ^39^310^311..... 3(n-2)63(n-l)C3n}, where
Let C4 = {en(,en-]e4%,e,ge4\Qe4\\,...,e4(n-2)^4(,n-i)S4n], where VC4) = ViK',) {45}.

Clearly the cycles of Ci, C2, C3 and C4 are disjoint and the vertices 634,635 and 45 form a 3-cycle. Continuing this process we get ICI = ^ , IC2I = ^ , IC3I = ^ , IC4I = ^ , IC5I = ^ , , |C_5| = 1, |C_4| = 1, |C_3| = I. C-2. Cn-\ and Cn are empty. Let Cn+\ be the set of cycles formed by the vertices of ViK'.) - V(C'). (3 < ( < n). i.e.,C.n = |e,{,+i)e,{,+2)e(,+ixi+2) : ( = 3:, 1 :< : < - \. Clearly C+i contains disjoint cycles and |C+i| - -. Hence minimum number of cycles of LiKn) is |C,| =

Since n . 2 ( . . . 3), ^ ^ i ^ i ^ = f ^ ^ l . Therefore r(L(i.)) ,

www.ccsenet.org/jmr 147

Joumal of Mathematics Research Vol. 2, No. 2, May 2010

ISSN: 1916-9795 E-ISSN: 1916-9809

Case (iii) : n s Oimod 3) n is a multiple of 3. In this case the disjoint cycles of LiKn) aie counted as follows.Let C, be the set of cycles of the clique K il <i< n) and let V(C,) be the set of vertices belonging to the cycles of C,,
LetCi = {ei4ei5ei6,ci7ei8ei9,,,ei(-2)ei(-i)ei}, where V(Ci) = ViK\)-{en,eu]. Let C2 = (^24^25626. ^27^28^29. - , e2{-2)e2(-i)e2l, where VC2) = ViK'^) - (231- Now en, ei3 and ^23 form a 3-cycle, Let C3 = {e34e35e36,637638^39, - e3(_2)e3(-i)e3l. where VC3) = ViK'^). Let C4 = {e47e48e49, ...,e4(-2)e4(-i)e4K where VC4) = ViK'^) - {645,^46).
Let C5 = {^57658^59. ...,es(n-2)e5(n-\)e5n], where

Now the vertices 45, ^46 and e56 form a 3-cycle, Continuing this process we get \C\ | = ,

, IC2I =

, IC3I =

, |C_5| = 1, |C_4| = 1, |C_3| = 1. \Cn-2\ = \Cn-\\ = \Cn\ = 0. Let C+, be the set of cycles formed by the vertices

ViK)-ViC),il<i<n).
i.e.,C+i = |e,(,+i)e,(,+2)e(/+i)(,+2) : = 3/: - 2,1 < < ^ | and clearly |C+i| - ^, Minimum number of cycles of LiKn) is :

I |c,| . ^("-^). Therefore riUKn)) > ^ ^ ^ = [^^^\

Now by the very definitions, LiKn) has

^"'^^ i" ^" *e three cases T(L(^)) >

= ,

[ ^ ]

vertices and hence TiLiKn)) <

Hence rmKn))=[^].
Each vertex v, of a graph G with degree deg v, induce a clique of order deg v, in LiG). i.e.. At each vertex v, of G, we count -fi^ Theorem 2.2. vertex disjoint cycles in LiG). The above argument yields the following result which gives an upperbound for the tulgeity of line graph of any graph.

The following result characterize the graph for which the above said inequality becomes equal.

Theorem 2.3. If G isa tree and for each pair of vertices (v;, v^) with deg v,, deg vj > 2, if there exist a vertex v of degree 2 on Fivi, vj) then TLG)) =
Froof Let T be a graph satisfying the given condition. Each vertex v, of T of degree > 2 induce a clique of order deg v,- in LiG) and since for each pair of vertices (v,, vj) of T with degree > 2, there exists a vertex v of degree 2 on /'(v,, v;), there deg Vi 1

The tulgeity of complete n-partite graphs have been studied by Gary Chartrand et.al in (1968). Here we derive a formula for the tulgeity of line graph of complete bigraph. Theorem 2.4. The tulgeity of line graph of complete bigraph graph Km,n, riLiK,,)) = ""
Froof Without loss of generality assume that m < n. Let ViKm,n) = {vi, V2, ., v) U (i, M2, .,,,) and EiK,n) - [eij =

ViVj : I < i < m,\ < i < n\, |(/fm,)| = mn. By the definition of line graphs, ViLiK^^n)) = {eij : I < i < m,l < j < n] in which eij and eki are adjacent if either i = k or j = I. Hence \ViLiKm.n)\ = mn and hence TLiKm,n)) < ^ . Let V, = {ej : I < j < n],il < i < m). Clearly <V,) is a complete subgraph of LiKm,n) for each i. Similarly if
V. = {eij : \ < i <m],il Case (i): If n s Oimod 3) then |V;| = Oimod 3) and hence there exist - vertex disjoint cycles in (V,> for each i,(i :< ' < m). If m = Oimod 3) then |V",| = Oimod 3) and hence there exist vertex disjoint cycles in ^Vj) for each j , (1 < ;' < n). In both the cases minimum number of vertex disjoint cycles in LiKm,n) '^ ~ r = p T Hence TiLiK^^n)) > - r - . 148 www.ccsenet.org/jmr < j < n) then (v'\ is a complete subgraph of LiKm,n).

ISSN: 1916-9795 E-ISSN: 1916-9809

Joumal of Mathematics Research Vol. 2, No. 2, May 2010

Case (ii): = l{n If n = l{mod 3) then V, - {,), (1 < / < m) has n - 1 vertices for each i and there exist vertex disjoint cycles in

- {eij] for each i. Also, since (e^, e2,.-, e^) is a complete subgraph there exist vertex disjoint cycles. Hence
/ 1 \ f l r ' i L . J J

Case (iii):
. If n s 2{mod 3) and m = l{mod 3) then V, - ({e,) U (e,(_i))), (1 < :< m) has n - 2 vertices for each / and there exist n - 2 vertex disjoint cycles in V,- - ((e,} U {e,(_i)}) for each /. Also since m s l{mod 3), <ei(-i),e2(-i), ..,(-!)> has m-1

vertex disjoint cycles and (ci,e2,...,c) has ^ ^ ^ vertex disjoint cycles. Hence T{L{Kn,,n)) > ^ ^ " ~ ^^ + ^ m-1 mn-2 Tmni 3 ~ 3 Case (iv): If n s 2{mod 3) and m = 2{mod 3) then V,- - ({e,) U {e,(_i)} U {e,(_2)}), (1 < ( < m) has (n - 3) vertices for each i and . n- 3 there exist -yvertex disjomt cycles in V,- - ((e,} U {e,(_i)) U {e,(_2)}), (1 < < m) for each i. Also m = 2(mod 3), / \ u ^ ~ 2 ' /?z 2 \ei(_i), e2(-i),... e(;-2)(-i)) has J - vertex disjoint cycles and (ei, e2,.., e(m-2)n) has vertex disjoint cycles. At last the vertices e(-i)(-i), e(_i), (_,), e, induces a 4-cycle. Hence T(L(/S:,)) > ^ ^ " ~ ^^ + 2 ^ ^ ^ H- 1 = ^ " ~ ^ =

^ ] . Hence in all the cases T(L(^,)) > [ ^ ] . Hence T(Z.(i:,)) = [|^].

References Anton Kundrik. (1990). Dual point partition number of complementary graphs. Mathematica Slovaca, 40(4), 367-374. Frank Harary. (1969). Graph Theory. New Delhi: Narosa Publishing home. Gray Chartrand., Dennis Geller., & Stephen Hedetniemi. (1971). Graphs with forbidden subgraphs. Joumal of Combinatorial Theory, 10, 12-41. Gray Chartrand., Hudson V. Kronk., & Curtiss E. Wall. (1968). The point arboricity of a graph. Israel Joumal of Mathematics 6(2), 168-175.

www.ccsenet.org/jmr

Copyright of Journal of Mathematics Research is the property of Canadian Center of Science & Education and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use.