OLD AND NEW GENERALIZATIONS OF LINE GRAPHS
|
|
- Teresa Bradford
- 5 years ago
- Views:
Transcription
1 IJMMS 2004:29, PII. S Hindawi Publishing Cop. OLD AND NEW GENERALIZATIONS OF LINE GRAPHS JAY BAGGA Received 8 Octobe 2003 Line gaphs have been studied fo ove seventy yeas. In 1932, H. Whitney showed that fo connected gaphs, edge-isomophism implies isomophism except fo K 3 and K 1,3.The line gaph tansfomation is one of the most widely studied of all gaph tansfomations. In its long histoy, the concept has been ediscoveed seveal times, with diffeent names such as deived gaph, intechange gaph, and edge-to-vetex dual. Line gaphs can also be consideed as intesection gaphs. Seveal vaiations and genealizations of line gaphs have been poposed and studied. These include the concepts of total gaphs, path gaphs, and othes. In this bief suvey we descibe these and some moe ecent genealizations and extensions including supe line gaphs and tiangle gaphs Mathematics Subject Classification: 05C75, 05C45, 05C62, 05C Intoduction. The line gaph L(G) of a gaph G is defined to have as its vetices the edges of G, with two being adjacent if the coesponding edges shae a vetex in G. Line gaphs have a ich histoy. The name line gaph was fist used by Haay and Noman [17] in But line gaphs wee the subject of investigation as fa back as 1932 in Whitney s pape [24], whee he studied edge isomophism and showed that fo connected gaphs, edge-isomophism implies isomophism except fo K 3 and K 1,3.The fist chaacteization (patition into complete subgaphs) was given by Kausz [19]. Since this is a suvey on genealizations of line gaphs, we will not descibe line gaphs and thei popeties in any detail hee. Instead, we efe the inteested eade to a somewhat olde but still an excellent suvey on line gaphs and line digaphs by Hemminge and Beineke [18]. A moe ecent book by Pisne [22] descibes many inteesting genealizations of line gaphs. Fo geneal gaph theoetic concepts and teminology not defined hee, please see [9, 16]. In the est of this section, we will make some geneal emaks on the natue of eseach in line gaphs and the genealizations that have been studied. In the following sections, we descibe some genealizations and vaiations of the line gaph concept. We descibe two, supe line gaphs and tiangle gaphs, in somewhat geate detail. We also mention some open poblems in this aea. Accoding to the above-mentioned aticle by Hemminge and Beineke, much of the effot in the ealy eseach concentated on the detemination poblem (detemine which gaphs have a given gaph as thei line gaph) and the chaacteization poblem (chaacteize those gaphs that ae line gaphs of some gaph). Kausz [19] gave a chaacteization of line gaphs in tems of complete subgaphs. Thee ae seveal othe chaacteizations mentioned in [18], including the fobidden subgaph chaacteization
2 1510 JAY BAGGA Figue 1.1 by Beineke [11], which states that a gaph is a line gaph if and only if it has no induced subgaph isomophic to any of the gaphs shown in Figue 1.1. One can view the line gaph as a tansfomation G L(G). Repeated applications of this tansfomation yield iteated line gaphs, which have been studied by seveal authos. Thus iteated line gaphs ae defined by L 1 (G) = L(G) and L n+1 (G) = L(L n (G)) (povided that L n (G) is not null). Questions about convegence have been consideed. If G is the path P n on n vetices, then L(G) = P n 1.Hence{L n } teminates fo paths. If G is a cycle, then L(G) G. AlsoL(K 1,3 ) = K 3. Hence fo these gaphs {L n } becomes a constant. Fo all othe connected gaphs, {L n } contains abitaily lage gaphs [23]. Othe popeties of iteated line gaphs such as Hamiltonicity have also been studied. Theoem 1.1 [13]. Let G be a connected gaph of ode p that is not a path. Then L n (G) is Hamiltonian fo all n p 3. See Pisne [22] fo details on the line gaph tansfomation and seveal othe simila concepts and esults on iteations. Line gaphs have edges as thei vetices. An edge can be viewed as a subset of two adjacent vetices, a clique of ode two, a path of length one, o a subgaph of size one, among othes. Depending on which view is consideed, genealizations and extensions of line gaphs esult by genealizing the coesponding view. Fo example, in Section 4, we will descibe a ecent genealization called the tiangle gaph fo which the vetex set consists of the tiangles of G, with two being adjacent if they shae an edge. In the next section, we descibe some ealie genealizations of line gaphs. 2. Old genealizations 2.1. Total gaphs. The total gaph T(G) of a gaph G, defined by Behzad and Chatand [10], takes both the vetices and edges of G as elements fo its set of vetices.
3 OLD AND NEW GENERALIZATIONS OF LINE GRAPHS 1511 u w uvw v x uvx vxy xyz wvx vxz xzy y z yxz G P 2 (G) Figue 2.1 Two vetices ae adjacent if the coesponding elements of G ae eithe adjacent o incident. Recall Vizing s theoem, which states that if G has maximum degee, then χ(l(g))= o + 1, Behzad conjectued that χ(t(g)) = + 1o + 2. Whethe any gaph has total chomatic numbe geate than +2 is still an open question [15] Middle gaphs. The middle gaph mid(g) of G is obtained fom G by inseting a new vetex into evey edge of G and by joining those pais of new vetices which lie on adjacent edges of G. Thus mid(g) can also be consideed as the intesection gaph of all K 1 s and K 2 s in G [22]. We obseve that (i) L(G) is an induced subgaph of mid(g), (ii) the subdivision gaph S(G) is a subgaph of mid(g), (iii) mid(g) is a subgaph of T(G) Entie gaphs. Theentiegaphe(G) of a plane gaph G is the gaph whose vetices coespond to vetices, edges, and egions of G. Two vetices of e(g) ae adjacent if the coesponding elements of G ae adjacent o incident. See [20] fo some esults on entie gaphs Path gaphs. The thpath gaph (G) [12] has the paths of length in G as its vetices and two such paths ae adjacent if thei union is a path o cycle of length +1. Fo = 1, we obtain the line gaph. An example fo = 2 is shown in Figue 2.1. We obseve that a path of length in G coesponds to an isolated vetex in (G) if and only if its end vetices have degee 1 in G. Thus, connectedness of G is not inheited by the th path gaph fo >1. Boesma and Hoede [12] also show that the numbes of vetices and edges in 2 (G) ae ( ) deg(v) v and (1/2) 2 v[(deg(v) 1) u v(deg(u) 1)], espectively (whee denotes adjacency) subgaph distance gaphs. Let (G) be the gaph whose vetices ae the subgaphs of G having edges, with two such being adjacent if the symmetic diffeence of thei edge sets consists pecisely of two adjacent edges of G. S (G) is called
4 1512 JAY BAGGA a b ab c d ac ad bc bd cd G S 2 (G) Figue 2.2 the -subgaph distance gaph (Chatand et al. [14]). An example fo = 2 is shown in Figue 2.2. Note that two subgaphs (with edges) in G ae adjacent if one can be obtained fom the othe by pivoting one edge. Because (G) is connected wheneve G is connected (and has at least edges), it povides a measue of the distance between two subgaphs of size in G. 3. Supe line gaphs. In this section, we descibe in somewhat geate detail a moe ecent genealization, the supe line gaph. Supe line gaphs wee intoduced by Bagga et al. in [6]. Since then, the study of supe line gaphs has pogessed much futhe [1, 2, 3, 4, 5, 6] Definition and basic popeties. Fo a fixed intege (with 1 q = E(G) ), the supe line gaph (G) of index has the sets of edges in G as its vetices, and two vetices ae adjacent if an edge in one set is adjacent (in G) to an edge in the othe. It follows that 1 (G) is the usual line gaph. Figue 3.1 shows an example of a gaph G and the gaph 2 (G). Fo simplicity, we denote a set {x,y} of edges by xy. Seveal vaiations of the definition of a supe line gaph can be consideed. Fo example, one could fom a multigaph by joining two vetices with as many edges as thee ae adjacencies between the two sets of edges. We call this the supe line multigaph. See [3] fo some esults. O, we can fom the intesection gaph of the sets of vetices on the two sets of edges. The supe line gaph opeato has nice heeditay popeties, as the next two esults show [1]. Theoem 3.1. (H). If G is a subgaph of gaph H, then (G) is an induced subgaph of Theoem 3.2. Let G be a gaph with q edges. Fo <q/2, (G) is isomophic to a subgaph of +1 (G). The definition of adjacency in the supe line gaph (G) implies that if two vetices (say) S and T ae nonadjacent, then (with S and T consideed as -sets of edges) thei
5 OLD AND NEW GENERALIZATIONS OF LINE GRAPHS 1513 b a c ab bc G : L 2 (G) : ac bd d ad cd Figue 3.1 intesection S T is a set of isolated edges in the subgaph (of G) of thei union S T. This leads to ou next esult [6]. Theoem 3.3. If S and T ae -sets of edges in G such that neithe consists entiely of isolated components of G, then the distance between S and T in (G) is 1 o 2. Poof. If such S and T ae not adjacent in (G),thenGcontains an edge e adjacent to some edge in S and an edge f adjacent to some edge in T.NowletR be any set of edges of G containing e and f.thenboths and T ae adjacent to R in (G), andso the distance between them is 2. Coollay 3.4. If G is a gaph in which fewe than components ae isolated edges, then (G) has diamete 1 o 2. Coollay 3.5. Fo a gaph G, at most one component of (G) is nontivial Line completion numbe. We obseve that if (G) is complete, so is s (G) fo s q. This leads us to define the line completion numbe lc(g) of gaph G to be the minimum index fo which (G) is complete. Clealy, lc(g) q. We obseve that the only gaphs with the line completion numbe 1 ae the stas and K 3. A geneal bound on line completion numbe is given by the following esult [6]. Theoem 3.6. If G is a gaph with q edges and c components, then lc(g) (q + c)/2, and this bound is shap. The next theoem [5] descibes which gaphs have small o lage line completion numbes. Theoem 3.7. (i) lc(g) = 1 if and only if G is K 1,n o K 3. (ii) lc(g) 2 if and only if G does not have 3K 2 o 2P 3 as a subgaph. (iii) lc(g) 3 if and only if G does not have any of the following as a subgaph: 4K 2, K 2 2K 1,2, 2K 3, K 3 P 4, K 3 K 1,3, 2K 1,3, K 1,3 P 4. (iv) lc(g) = q if and only if G qk 2. (v) lc(g) = q 1 if and only if G P 3 (q 2)K 2 o G 2P 3 (q 4)K 2. Line completion numbes of seveal classes of gaphs have been found. We list some of these in the next theoem. See [5] fo moe details.
6 1514 JAY BAGGA Theoem 3.8. (i) If T is a tee of ode n 2, then lc(t ) n/2. Futhemoe, fo any intege k satisfying 1 k n/2, thee is a tee T of ode n with lc(t ) = k. (ii) lc(k n ) = (1/2) n/2 ( n/2 1)+1. (iii) lc(p n ) = lc(c n ) = n/2. (iv) lc(k 1 +P n ) = lc(k 1 +C n ) = 2n/3. (v) lc(k 1 +nk 2 ) = 3n/4 +1. Line completion numbes of seveal othe classes of gaphs have also been obtained. These classes include hypecubes, laddes, and gids. One class of gaphs fo which only patial esults ae known is the class of complete bipatite gaphs. We list the known cases in the next theoem. Theoem 3.9. (i) Fo m = 2, n = 2s, lc(k m,n ) = s+1 = mn/4+1. (ii) If m n, and m is odd, then lc(k m,n ) = n( 2 1)/4m. (iii) lc(k 2,2q+1 ) = 2 q. (iv) lc(k 2,2q+3 ) = (q+1) fo q 1. (v) lc(k 2 +1,2 +4k ) = ( +k) 2 fo 4k 2 3k. A complete detemination of lc(k m,n ) is still open Cycles in supe line gaphs. We now descibe seveal inteesting esults on cycles in supe line gaphs. Even though supe line gaphs can be dense, they, in geneal, do not satisfy well-known sufficient conditions fo Hamiltonicity. Fo any connected gaph G, howeve, 2 (G) tuns out to be vetex pancyclic, that is, evey vetex lies on cycles of length thee though the ode of the gaph. In fact, as we see below, this esult is tue fo many disconnected gaphs also. We will state most esults without poof. Howeve, to give a flavo of the techniques used, we include a special esult with poof. Theoem If T is a tee with q 2 edges, then 2 (T ) is pancyclic. Poof. The poof is by induction on q.foq 4, it can be easily checked that 2 (T ) is complete, which is also tue if T is a sta. Assume that T is not a sta and that q>4. Choose a vetex u of T such that deg(u) > 1, and evey neighbo of u, exceptone, say v, is an end vetex. Since T is not a sta, such a vetex always exists. Let S be the sta with cente u, and let T v be the subtee of T obtained by emoving u and all its neighbos except v. Lets = deg(u) so that T v has = q s edges. By ou choice of u and v, it follows that >0 and s>1. If = 1, then 2 (T ) is complete. If = 2 with (say) E(T v ) ={f 1,f 2 },then 2 (T ) f 1 f 2 is complete, and deg 2 (T ) f 1 f 2 > 1. Hence 2 (T ) is pancyclic. Thus we may assume that 3. Now the vetex set of 2 (T ) is the (disjoint) union of V( 2 (S)), V( 2 (T v )), andthe set W ={ab a E(T v ), b E(S)}. Also, 2 (S) is complete and, by the induction hypothesis, 2 (T v ) is pancyclic. Let C v be a spanning cycle of 2 (T v ).AlsoletX 1 X 2 be an edge of C v, whee X 1 = f 1 e and X 2 = f 2 f, whee f 1,e,f 2,f E(T v ) and f 1 is adjacent to f 2. We obseve that W =s.sinces is a sta with s edges, the subgaph of 2 (T ) induced by W contains the complete multipatite gaph K,,..., as a spanning subgaph.
7 OLD AND NEW GENERALIZATIONS OF LINE GRAPHS 1515 Hence, it contains paths of lengths 1 though s 1. We can also assume that the end vetices of each of these paths ae Y 1 = f 1 g and Y 2 = f 2 h, whee f 1 and f 2 ae as above, and g,h E(S). Now, in 2 (T ), X 1 and Y( 2 ) ae adjacent, as ae X 2 and Y 1. Hence we can constuct cycles of lengths C v +j = +j, fo2 j s, by identifying the ends of each of the 2 above paths appopiately with ( ) those of the path C v X 1 X 2. Let C be a cycle of length + s so constucted. By ou constuction, C contains 2 edges fom the subgaph of 2 (T ) induced by W. Also, evey vetex of the complete gaph 2 (S) = K ( s is adjacent to all vetices of W. It follows that C can be extended to 2) ( ) ( ) ( ) cycles of each length fom s +s+1 to s +s ( ) It emains to show the existence of a cycle of length + 1. Fo this, choose thee 2 adjacent vetices, say, a 1 b 1, a 2 b 2, and a 3 b 3 on C v. Assume that a 1 is adjacent to a, and that a 3 is adjacent to b, fo some a,b E(T v ) (not necessaily distinct). Choose two adjacent edges e 1 and e 2 in S and eplace the P 3 fomed by the above thee vetices by the P 4 fomed by a 1 b 1, ae 1, be 2, a 3 b 3 to poduce the equied cycle. This completes the poof. Now this esult can easily be extended to all connected gaphs. Theoem If G is connected, with q 2, then 2 (G) is pancyclic. Poof. The poof is by induction on the numbe of cycles in G. The base case is coveed by the pevious theoem. Let e = uv be a cycle edge, and w a new vetex not in V(G). Constuct a gaph H = G e +f, whee f = uw. Then 2 (H) is isomophic to a spanning subgaph of 2 (G). ThenH is connected and has fewe cycles than G. Hence by the induction hypothesis, 2 (H) is pancyclic. It follows that 2 (G) is pancyclic. As we stated befoe, howeve, a much stonge esult than the one given in the above theoem holds. We state this in ou next theoem [2]. Theoem If G is a gaph with no isolated edges, then 2 (G) is vetex pancyclic. While it may be possible to extend this theoem to some gaphs having isolated edges, it cannot be done fo all gaphs, even to thei nontivial components. Fo example, let G be the disjoint union P 4 2K 2, then the nontivial component of 2 (G) is the complete multipatite gaph K 1,1,2,5, which clealy is not Hamiltonian, and thus is not pancyclic. Howeve, we believe that, fo a gaph G with at most one isolated edge, 2 (G) is pancyclic, and that it may even be vetex pancyclic. Futhe poblems along these lines suggest themselves. Fo example, find conditions on G unde which 2 (G) has isolated vetices but the nontivial component is Hamiltonian, pancyclic, o vetex-pancyclic. Anothe open poblem is to study 2 (G) in elation to Hamiltonian connectedness and panconnectedness Independence numbe. Let M be a set of independent edges in a gaph G. IfA and B ae -sets of M, thena and B ae nonadjacent in (G). Howeve, not all pais of nonadjacent vetices aise in this way. It is also the case that two -sets of edges of G ae nonadjacent in (G) if they geneate vetex-disjoint subgaphs. What we
8 1516 JAY BAGGA show is that when one consides a set of independent vetices in (G) of maximum ode, then with a few exceptional families of gaphs, it is poduced by a maximum independent set of edges of G. Weuseα(G) and α (G) fo the independence numbe and edge-independence ) numbe of G, espectively. We also denote the set of all -sets of a set X by. ( X Ou next esult [2] gives the independence numbe of (G) in tems of the edgeindependence numbe of G. Let G be a gaph with at least edges. Then the independence num- α ( (G) ) ( ) α (G) =. (3.1) Theoem be of (G) is Futhemoe, ) if S is a maximum independent set of vetices in (G), then eithe (i) S = fo some maximum independent set X of edges of G, o ( X (ii) S consists of +1 disjoint stas K 1,,o (iii) = 3 and the vetices in S ae K 1,3 s o K 3 s. Poof. If X is a maximum independent set of edges of G, then, clealy, -sets of X ae independent vetices in (G). Thus, α ( (G) ) ( ) α (G). (3.2) To pove the evese inequality, let V 1,V 2,...,V k be -sets of E(G) which ae independent vetices in (G). Also, let m = numbe of these sets which ae matchings in G, l = numbe of these sets which ae not matchings in) G, and h = numbe of edges of G in the union of the m matchings. Clealy, m.letu = V 1 V 2 V k.we obseve that if two edges of U ae adjacent in G, they must belong to the same V i and each such pai is in only one V i. Thus, we fom an independent set of edges in G by taking the h edges mentioned above, and one of the nonindependent edges of each of the l nonmatchings. Hence, l +h α (G) = α, and theefoe, ( h ( ) ( ) ( ) h l +h α k = l +m l +, (3.3) fom which we have the desied inequality. To pove the ( second ) pat, let S ={V 1,V 2,...,V k } be a maximum independent set in (G) with k = α. It follows fom (3.3) that ( ) ( ) ( ) h l +h α k = l +m = l + = =. (3.4) ( ) ( ) If l = 0, then k = m = h = α so that S satisfies (i). If = 1, then again all V i s ae) matchings ) so that l = 0. Thus we assume that l>0 and >1. In this case, l + = implies that h = 0andl = + 1. Consequently, α = + 1. Moeove, it ( h ( l+h
9 OLD AND NEW GENERALIZATIONS OF LINE GRAPHS 1517 follows that m = 0, so that no V i is a matching. If any V i is not a sta, then it has two independent edges o it is a K 3. In the fist case, one obtains + 2 independent edges in G, a contadiction. In the second case, it follows that = 3 so that each V i is a K 3 o a K 1,3. The above theoem chaacteizes the maximum independent sets in (G). Weobseve that moe can be said about the stuctue of G in cases (ii) and (iii), namely, that each additional edge in G must join the cente of one sta to some vetex in anothe component Othe popeties and types of supe line gaphs. We have descibed seveal diffeent stuctual and othe popeties of supe line gaphs. The wealth of esults indicates that this is a ich and fetile aea fo eseach. Some open poblems wee listed in the above subsections. Bagga et al. [1, 2, 3, 5, 6] have also studied vaiations such as supe line multigaphs and supe line digaphs. Howeve, only some peliminay wok has been done fo these vaiations and futhe exploations ae equied. 4. Tiangle gaphs. In this section, we descibe anothe ecent genealization of line gaphs. As noted in the intoduction, the vetices of the line gaph can be consideed as cliques of ode 2, with two being adjacent if they have a K 1 in common. This concept has been genealized to clique gaphs. We will mention the geneal case in the next section. Hee, we conside the special case of tiangles. The tiangle gaph of G, denoted by (G), isthegaphwithvetexsetthesetof tiangles in G. Two vetices ae adjacent in (G) if, as tiangles of G, they shae an edge in common. If G has no tiangle, then (G) is undefined. A gaph H is called a tiangle gaph if H (G) fo some G. Othewise it is called a nontiangle gaph. In [21], the poblem of detemining necessay and sufficient conditions fo a gaph to be a tiangle gaph was aised. In [7, 8], thee is some ecent pogess towads a solution to this poblem. We descibe some of these esults below Some classes of tiangle gaphs. We begin by listing seveal classes of gaphs which ae tiangle gaphs. It is easily seen that K n is a tiangle gaph since K n = (K 1,1,n ). Similaly, cycles and paths can be shown to be tiangle gaphs since C n (W n ),fon 4, whee W n is the wheel, and P n (W n e), whee e is a im edge. Some poducts. K m K n = (K 1,m,n ), K m C 3 = K m K 3 (K 1,m,3 ), K m C n = (K m C n ),(m,n 3), and K m P n = (K m P n+1 ) ae all tiangle gaphs. The Platonic gaphs. As Figue 4.1 shows, Q 3 = (octahedon). Also, tetahedon = K 4 = (K 1,1,4 ) and dodecahedon = (icosahedon). We will see below that the octahedon and the icosahedon ae nontiangle gaphs. Theoem 4.1. A tee H is a tiangle gaph if and only if (H) 3. Poof. Obseve that a gaph that contains K 1,4 as an induced subgaph is a nontiangle gaph. Convesely, if (H) 3, use induction on (V (H)). We next descibe a necessay condition involving K 4 e [8].
10 1518 JAY BAGGA Figue Figue 4.2 Theoem 4.2. If H is a tiangle gaph with K 4 e as an induced subgaph, then thee exists a vetex x in H such that x is adjacent to thee vetices of one tiangle of K 4 e and nonadjacent to the fouth vetex. Coollay 4.3. Coollay 4.4. Fo any n 4, K n e is not a tiangle gaph. The octahedon and the icosahedon ae nontiangle gaphs Tiangle labeling of a gaph. We next conside anothe class of gaphs that stictly includes the class of tiangle gaphs. A tiangle labeling of a gaph is defined to be a mapping f : V(H) N 3 (tiples of positive integes) such that xy E(H) if and only if f(x) f(y) =2. Figue 4.2 shows a tiangle labeling of the Petesen gaph. It can be shown by a diect agument that the Petesen gaph is not a tiangle gaph. Theoem 4.5. A tiangle gaph admits a tiangle labeling. The convese is not tue. This leads us to define some new classes of gaphs as follows. Let = the set of line gaphs, s = the set of induced subgaphs of line gaphs, = the set of tiangle gaphs,
11 OLD AND NEW GENERALIZATIONS OF LINE GRAPHS 1519 s = the set of induced subgaphs of tiangle gaphs, and l = the set of gaphs that admit a tiangle labeling. We then have the following esult [8]. Theoem 4.6. (i) = s. (ii) s. (iii) s = l. Fo some moe necessay conditions on tiangle gaphs, and some othe classes of tiangle gaphs, we efe the eade to [8]. The geneal chaacteization of tiangle gaphs is an open poblem and futhe exploations in this aea should be undetaken Open poblems. We conclude ou discussion of tiangle gaphs by listing a few poblems and diections fo moe investigations in this aea. Of couse, it would be nice to have a chaacteization of tiangle gaphs. As mentioned above, [8] has made some pogess in this diection by obtaining a numbe of necessay conditions, including a fobidden subgaph condition. We saw ealie that seveal poduct gaphs ae tiangle gaphs. Simila questions can also be asked fo othe poducts; in paticula, fo which gaphs G is the Catesian poduct K n G a tiangle gaph? We obseve that (K 5 ) = L(K 5 ). One wishes to chaacteize G fo which (G) L(G). Similaly, when is (G) G? LetG 1 and G 2 be gaphs in which each edge belongs to a tiangle. Unde what conditions does (G 1 ) (G 2 ) imply that G 1 G 2? Motivated by the definition of line completion numbe defined in Section 3.2, we can define the tiangle completion numbe, tc(g), to be the minimum numbe of edges to be added to G so that the esulting gaph becomes a tiangle gaph. As a fist step, one wants bounds fo tc(g) fo a given gaph G. 5. Some moe genealizations. It was mentioned at the beginning of Section 4 that tiangle gaphs ae a special case of clique gaphs, a moe geneal vaiation on line gaphs. In this section, we biefly descibe clique gaphs and some othe vaiations. Fo moe details and esults, we efe the eade to Pisne [22]. We obseve that by a clique of a gaph G, we mean a complete subgaph of G. Some authos (including Pisne [22]) use the tem simplex fo a complete subgaph and clique fo inclusion-maximal simplices. Since an edge is a clique of ode 2, a genealization of the line gaph L(G) of agaphg is obtained when one consides all cliques of G of a fixed ode. Depending on how one defines adjacency, seveal vaiations ae possible, as we see below. The following definitions ae fom [22]. (i) The k-gallai gaph k (G) has all K k s in G as vetices, with two adjacent if thei union induces a K k+1 e. Obseve that 1 (G) = G. (ii) The k-in-m gaph Φ k,m has all K k s in G as vetices, with two adjacent if they lie in a common K fo some m. (iii) The k-line gaph L k (k 2) has all K k s in G as vetices, with two adjacent if thei intesection is a K k 1. We obseve that L k (G) is the edge-disjoint union of Φ k,k+1 (G) and k (G). (iv) The k-ovelap clique gaph C k (G) of G has all maximal cliques of G as vetices, with two adjacent wheneve thei intesection contains at most k vetices.
12 1520 JAY BAGGA (v) The cycle gaph Cy(G) of a gaph G has all induced cycles of G as vetices, with two adjacent if they shae some common edge. Fo moe such genealizations and thei popeties, we efe the eade to [22]. 6. Conclusion. In this bief suvey, we have descibed line gaphs and thei genealizations. Many of the genealizations ae well known and well studied. Othes ae moe ecent. Fo all genealizations, a numbe of poblems and aeas of futhe study have been pesented. This in an active aea of eseach. We have included a set of efeences which have been cited in ou desciption. These efeences ae just a small pat of the liteatue, but they should povide a good stat fo eades inteested in this aea. Acknowledgment. The autho wishes to expess his gatitude to all of his coauthos listed in the efeences. The autho also thanks the efeees fo thei helpful comments. Refeences [1] J.S.Bagga,L.W.Beineke,andB.N.Vama,Supe line gaphs and thei popeties, Combinatoics, Gaph Theoy, Algoithms and Applications (Beijing, 1993), Wold Scientific Publishing, New Jesey, 1994, pp [2], Independence and cycles in supe line gaphs, Austalas. J. Combin. 19 (1999), [3], The supe line gaph 2, Discete Math. 206 (1999), no. 1 3, [4] K. J. Bagga and M. R. Vasquez, The supe line gaph 2 fo hypecubes, Cong.Nume.93 (1993), [5] K.S.Bagga,L.W.Beineke,andB.N.Vama,The line completion numbe of a gaph, Gaph Theoy, Combinatoics, and Algoithms, Vol. 1, 2 (Kalamazoo, Mich, 1992), Wiley- Intescience, New Yok, 1995, pp [6], Supe line gaphs, Gaph Theoy, Combinatoics, and Algoithms, Vol. 1, 2 (Kalamazoo, Mich, 1992), Wiley-Intescience, New Yok, 1995, pp [7] R. Balakishnan, Tiangle gaphs, Gaph Connections (Cochin, 1998), Allied Publishes, New Delhi, 1999, p. 44. [8] R. Balakishnan, J. Bagga, R. Sampathkuma, and N. Thillaigovindan, Tiangle gaphs, pepint, [9] R. Balakishnan and K. Ranganathan, A Textbook of Gaph Theoy, Univesitext, Spinge- Velag, New Yok, [10] M. Behzad and G. Chatand, Total gaphs and tavesability, Poc. Edinbugh Math. Soc. (2) 15 (1966/1967), [11] L. W. Beineke, Chaacteizations of deived gaphs, J. Combinatoial Theoy 9 (1970), [12] H. J. Boesma and C. Hoede, Path gaphs, J. Gaph Theoy 13 (1989), no. 4, [13] G. Chatand, On hamiltonian line-gaphs, Tans. Ame. Math. Soc. 134 (1968), [14] G. Chatand, H. Hevia, E. B. Jaett, F. Saba, and D. W. VandeJagt, Subgaph distance and genealized line gaphs, Gaph Theoy, Combinatoics, Algoithms, and Applications (San Fancisco, Calif, 1989), SIAM, Philadelphia, 1991, pp [15] A. G. Chetwynd, Total colouings of gaphs a pogess epot, Gaph Theoy, Combinatoics, and Applications, Vol. 1 (Kalamazoo, Mich, 1988), Wiley-Intescience, New Yok, 1991, pp [16] F. Haay, Gaph Theoy, Addison-Wesley, Massachusetts, [17] F. Haay and R. Z. Noman, Some popeties of line digaphs, Rend. Cic. Mat. Palemo (2) 9 (1960),
13 OLD AND NEW GENERALIZATIONS OF LINE GRAPHS 1521 [18] R. L. Hemminge and L. W. Beineke, Line gaphs and line digaphs, Selected Topics in Gaph Theoy (W. B. Lowell and R. J. Wilson, eds.), Academic Pess, New Yok, 1978, pp [19] J. Kausz, Démonstation nouvelle d une théoème de Whitney su les éseaux, Mat. Fiz. Lapok 50 (1943), (Hungaian). [20] J. Mitchem, Hamiltonian and Euleian popeties of entie gaphs, Gaph Theoy and Applications (Poc. Conf., Westen Michigan Univ., Kalamazoo, Mich, 1972; Dedicated to the Memoy of J. W. T. Youngs), Lectue Notes in Math., vol. 303, Spinge, Belin, 1972, pp [21] S. D. Monson, N. J. Pullman, and R. Rees, A suvey of clique and biclique coveings and factoizations of (0, 1)-matices, Bull. Inst. Combin. Appl. 14 (1995), [22] E. Pisne, Gaph Dynamics, Pitman Reseach Notes in Mathematics Seies, vol. 338, Longman, Halow, [23] A. C. M. van Rooij and H. S. Wilf, The intechange gaph of a finite gaph, Acta Math. Acad. Sci. Hunga. 16 (1965), [24] H. Whitney, Conguent gaphs and the connectivity of gaphs, Ame. J. Math. 54 (1932), Jay Bagga: Depatment of Compute Science, Ball State Univesity, Muncie, IN 47306, USA addess: jbagga@bsu.edu
14 Advances in Opeations Reseach Advances in Decision Sciences Jounal of Applied Mathematics Algeba Jounal of Pobability and Statistics The Scientific Wold Jounal Intenational Jounal of Diffeential Equations Submit you manuscipts at Intenational Jounal of Advances in Combinatoics Mathematical Physics Jounal of Complex Analysis Intenational Jounal of Mathematics and Mathematical Sciences Mathematical Poblems in Engineeing Jounal of Mathematics Discete Mathematics Jounal of Discete Dynamics in Natue and Society Jounal of Function Spaces Abstact and Applied Analysis Intenational Jounal of Jounal of Stochastic Analysis Optimization
OLD AND NEW GENERALIZATIONS OF LINE GRAPHS
IJMMS 2004:29, 1509 1521 PII. S0161171204310094 http://ijmms.hindawi.com Hindawi Publishing Cop. OLD AND NEW GENERALIZATIONS OF LINE GRAPHS JAY BAGGA Received 8 Octobe 2003 Line gaphs have been studied
More informationSUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER
Discussiones Mathematicae Gaph Theoy 39 (019) 567 573 doi:10.7151/dmgt.096 SUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER Lutz Volkmann
More informationON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS. D.A. Mojdeh and B. Samadi
Opuscula Math. 37, no. 3 (017), 447 456 http://dx.doi.og/10.7494/opmath.017.37.3.447 Opuscula Mathematica ON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS D.A. Mojdeh and B. Samadi Communicated
More informationOn decompositions of complete multipartite graphs into the union of two even cycles
On decompositions of complete multipatite gaphs into the union of two even cycles A. Su, J. Buchanan, R. C. Bunge, S. I. El-Zanati, E. Pelttai, G. Rasmuson, E. Spaks, S. Tagais Depatment of Mathematics
More informationON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION. 1. Introduction. 1 r r. r k for every set E A, E \ {0},
ON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION E. J. IONASCU and A. A. STANCU Abstact. We ae inteested in constucting concete independent events in puely atomic pobability
More informationOn the ratio of maximum and minimum degree in maximal intersecting families
On the atio of maximum and minimum degee in maximal intesecting families Zoltán Lóánt Nagy Lale Özkahya Balázs Patkós Máté Vize Septembe 5, 011 Abstact To study how balanced o unbalanced a maximal intesecting
More informationQuasi-Randomness and the Distribution of Copies of a Fixed Graph
Quasi-Randomness and the Distibution of Copies of a Fixed Gaph Asaf Shapia Abstact We show that if a gaph G has the popety that all subsets of vetices of size n/4 contain the coect numbe of tiangles one
More informationMath 301: The Erdős-Stone-Simonovitz Theorem and Extremal Numbers for Bipartite Graphs
Math 30: The Edős-Stone-Simonovitz Theoem and Extemal Numbes fo Bipatite Gaphs May Radcliffe The Edős-Stone-Simonovitz Theoem Recall, in class we poved Tuán s Gaph Theoem, namely Theoem Tuán s Theoem Let
More informationarxiv: v1 [math.co] 4 May 2017
On The Numbe Of Unlabeled Bipatite Gaphs Abdullah Atmaca and A Yavuz Ouç axiv:7050800v [mathco] 4 May 207 Abstact This pape solves a poblem that was stated by M A Haison in 973 [] This poblem, that has
More informationResearch Article On Alzer and Qiu s Conjecture for Complete Elliptic Integral and Inverse Hyperbolic Tangent Function
Abstact and Applied Analysis Volume 011, Aticle ID 697547, 7 pages doi:10.1155/011/697547 Reseach Aticle On Alze and Qiu s Conjectue fo Complete Elliptic Integal and Invese Hypebolic Tangent Function Yu-Ming
More informationA Bijective Approach to the Permutational Power of a Priority Queue
A Bijective Appoach to the Pemutational Powe of a Pioity Queue Ia M. Gessel Kuang-Yeh Wang Depatment of Mathematics Bandeis Univesity Waltham, MA 02254-9110 Abstact A pioity queue tansfoms an input pemutation
More informationNew problems in universal algebraic geometry illustrated by boolean equations
New poblems in univesal algebaic geomety illustated by boolean equations axiv:1611.00152v2 [math.ra] 25 Nov 2016 Atem N. Shevlyakov Novembe 28, 2016 Abstact We discuss new poblems in univesal algebaic
More informationThe Congestion of n-cube Layout on a Rectangular Grid S.L. Bezrukov J.D. Chavez y L.H. Harper z M. Rottger U.-P. Schroeder Abstract We consider the pr
The Congestion of n-cube Layout on a Rectangula Gid S.L. Bezukov J.D. Chavez y L.H. Hape z M. Rottge U.-P. Schoede Abstact We conside the poblem of embedding the n-dimensional cube into a ectangula gid
More informationOn the ratio of maximum and minimum degree in maximal intersecting families
On the atio of maximum and minimum degee in maximal intesecting families Zoltán Lóánt Nagy Lale Özkahya Balázs Patkós Máté Vize Mach 6, 013 Abstact To study how balanced o unbalanced a maximal intesecting
More informationAn intersection theorem for four sets
An intesection theoem fo fou sets Dhuv Mubayi Novembe 22, 2006 Abstact Fix integes n, 4 and let F denote a family of -sets of an n-element set Suppose that fo evey fou distinct A, B, C, D F with A B C
More informationThe Chromatic Villainy of Complete Multipartite Graphs
Rocheste Institute of Technology RIT Schola Wos Theses Thesis/Dissetation Collections 8--08 The Chomatic Villainy of Complete Multipatite Gaphs Anna Raleigh an9@it.edu Follow this and additional wos at:
More informationCOLLAPSING WALLS THEOREM
COLLAPSING WALLS THEOREM IGOR PAK AND ROM PINCHASI Abstact. Let P R 3 be a pyamid with the base a convex polygon Q. We show that when othe faces ae collapsed (otated aound the edges onto the plane spanned
More informationarxiv: v1 [math.co] 6 Mar 2008
An uppe bound fo the numbe of pefect matchings in gaphs Shmuel Fiedland axiv:0803.0864v [math.co] 6 Ma 2008 Depatment of Mathematics, Statistics, and Compute Science, Univesity of Illinois at Chicago Chicago,
More informationModified Linear Programming and Class 0 Bounds for Graph Pebbling
Modified Linea Pogamming and Class 0 Bounds fo Gaph Pebbling Daniel W. Canston Luke Postle Chenxiao Xue Cal Yege August 8, 05 Abstact Given a configuation of pebbles on the vetices of a connected gaph
More informationSupplementary information Efficient Enumeration of Monocyclic Chemical Graphs with Given Path Frequencies
Supplementay infomation Efficient Enumeation of Monocyclic Chemical Gaphs with Given Path Fequencies Masaki Suzuki, Hioshi Nagamochi Gaduate School of Infomatics, Kyoto Univesity {m suzuki,nag}@amp.i.kyoto-u.ac.jp
More informationFractional Zero Forcing via Three-color Forcing Games
Factional Zeo Focing via Thee-colo Focing Games Leslie Hogben Kevin F. Palmowski David E. Robeson Michael Young May 13, 2015 Abstact An -fold analogue of the positive semidefinite zeo focing pocess that
More informationANA BERRIZBEITIA, LUIS A. MEDINA, ALEXANDER C. MOLL, VICTOR H. MOLL, AND LAINE NOBLE
THE p-adic VALUATION OF STIRLING NUMBERS ANA BERRIZBEITIA, LUIS A. MEDINA, ALEXANDER C. MOLL, VICTOR H. MOLL, AND LAINE NOBLE Abstact. Let p > 2 be a pime. The p-adic valuation of Stiling numbes of the
More informationSyntactical content of nite approximations of partial algebras 1 Wiktor Bartol Inst. Matematyki, Uniw. Warszawski, Warszawa (Poland)
Syntactical content of nite appoximations of patial algebas 1 Wikto Batol Inst. Matematyki, Uniw. Waszawski, 02-097 Waszawa (Poland) batol@mimuw.edu.pl Xavie Caicedo Dep. Matematicas, Univ. de los Andes,
More informationJournal of Inequalities in Pure and Applied Mathematics
Jounal of Inequalities in Pue and Applied Mathematics COEFFICIENT INEQUALITY FOR A FUNCTION WHOSE DERIVATIVE HAS A POSITIVE REAL PART S. ABRAMOVICH, M. KLARIČIĆ BAKULA AND S. BANIĆ Depatment of Mathematics
More informationTurán Numbers of Vertex-disjoint Cliques in r- Partite Graphs
Univesity of Wyoming Wyoming Scholas Repositoy Honos Theses AY 16/17 Undegaduate Honos Theses Sping 5-1-017 Tuán Numbes of Vetex-disjoint Cliques in - Patite Gaphs Anna Schenfisch Univesity of Wyoming,
More informationMethod for Approximating Irrational Numbers
Method fo Appoximating Iational Numbes Eic Reichwein Depatment of Physics Univesity of Califonia, Santa Cuz June 6, 0 Abstact I will put foth an algoithm fo poducing inceasingly accuate ational appoximations
More informationDuality between Statical and Kinematical Engineering Systems
Pape 00, Civil-Comp Ltd., Stiling, Scotland Poceedings of the Sixth Intenational Confeence on Computational Stuctues Technology, B.H.V. Topping and Z. Bittna (Editos), Civil-Comp Pess, Stiling, Scotland.
More informationA solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
A solution to a poblem of Günbaum and Motzkin and of Edős and Pudy about bichomatic configuations of points in the plane Rom Pinchasi July 29, 2012 Abstact Let P be a set of n blue points in the plane,
More informationTHE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX. Jaejin Lee
Koean J. Math. 23 (2015), No. 3, pp. 427 438 http://dx.doi.og/10.11568/kjm.2015.23.3.427 THE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX Jaejin Lee Abstact. The Schensted algoithm fist descibed by Robinson
More informationDeterministic vs Non-deterministic Graph Property Testing
Deteministic vs Non-deteministic Gaph Popety Testing Lio Gishboline Asaf Shapia Abstact A gaph popety P is said to be testable if one can check whethe a gaph is close o fa fom satisfying P using few andom
More informationChromatic number and spectral radius
Linea Algeba and its Applications 426 2007) 810 814 www.elsevie.com/locate/laa Chomatic numbe and spectal adius Vladimi Nikifoov Depatment of Mathematical Sciences, Univesity of Memphis, Memphis, TN 38152,
More informationEQUI-PARTITIONING OF HIGHER-DIMENSIONAL HYPER-RECTANGULAR GRID GRAPHS
EQUI-PARTITIONING OF HIGHER-DIMENSIONAL HYPER-RECTANGULAR GRID GRAPHS ATHULA GUNAWARDENA AND ROBERT R MEYER Abstact A d-dimensional gid gaph G is the gaph on a finite subset in the intege lattice Z d in
More informationEnumerating permutation polynomials
Enumeating pemutation polynomials Theodoulos Gaefalakis a,1, Giogos Kapetanakis a,, a Depatment of Mathematics and Applied Mathematics, Univesity of Cete, 70013 Heaklion, Geece Abstact We conside thoblem
More informationSolution to HW 3, Ma 1a Fall 2016
Solution to HW 3, Ma a Fall 206 Section 2. Execise 2: Let C be a subset of the eal numbes consisting of those eal numbes x having the popety that evey digit in the decimal expansion of x is, 3, 5, o 7.
More informationConstruction and Analysis of Boolean Functions of 2t + 1 Variables with Maximum Algebraic Immunity
Constuction and Analysis of Boolean Functions of 2t + 1 Vaiables with Maximum Algebaic Immunity Na Li and Wen-Feng Qi Depatment of Applied Mathematics, Zhengzhou Infomation Engineeing Univesity, Zhengzhou,
More informationSOME SOLVABILITY THEOREMS FOR NONLINEAR EQUATIONS
Fixed Point Theoy, Volume 5, No. 1, 2004, 71-80 http://www.math.ubbcluj.o/ nodeacj/sfptcj.htm SOME SOLVABILITY THEOREMS FOR NONLINEAR EQUATIONS G. ISAC 1 AND C. AVRAMESCU 2 1 Depatment of Mathematics Royal
More informationThe Erdős-Hajnal conjecture for rainbow triangles
The Edős-Hajnal conjectue fo ainbow tiangles Jacob Fox Andey Ginshpun János Pach Abstact We pove that evey 3-coloing of the edges of the complete gaph on n vetices without a ainbow tiangle contains a set
More informationBounds for Codimensions of Fitting Ideals
Ž. JOUNAL OF ALGEBA 194, 378 382 1997 ATICLE NO. JA966999 Bounds fo Coensions of Fitting Ideals Michał Kwiecinski* Uniwesytet Jagiellonski, Instytut Matematyki, ul. eymonta 4, 30-059, Kakow, Poland Communicated
More informationOn a generalization of Eulerian numbers
Notes on Numbe Theoy and Discete Mathematics Pint ISSN 1310 513, Online ISSN 367 875 Vol, 018, No 1, 16 DOI: 10756/nntdm018116- On a genealization of Euleian numbes Claudio Pita-Ruiz Facultad de Ingenieía,
More informationSuborbital graphs for the group Γ 2
Hacettepe Jounal of Mathematics and Statistics Volume 44 5 2015, 1033 1044 Subobital gaphs fo the goup Γ 2 Bahadı Özgü Güle, Muat Beşenk, Yavuz Kesicioğlu, Ali Hikmet Değe Keywods: Abstact In this pape,
More informationNOTE. Some New Bounds for Cover-Free Families
Jounal of Combinatoial Theoy, Seies A 90, 224234 (2000) doi:10.1006jcta.1999.3036, available online at http:.idealibay.com on NOTE Some Ne Bounds fo Cove-Fee Families D. R. Stinson 1 and R. Wei Depatment
More informationDonnishJournals
DonnishJounals 041-1189 Donnish Jounal of Educational Reseach and Reviews. Vol 1(1) pp. 01-017 Novembe, 014. http:///dje Copyight 014 Donnish Jounals Oiginal Reseach Pape Vecto Analysis Using MAXIMA Savaş
More informationGroup Connectivity of 3-Edge-Connected Chordal Graphs
Gaphs and Combinatoics (2000) 16 : 165±176 Gaphs and Combinatoics ( Spinge-Velag 2000 Goup Connectivity of 3-Edge-Connected Chodal Gaphs Hong-Jian Lai Depatment of Mathematics, West Viginia Univesity,
More information3.1 Random variables
3 Chapte III Random Vaiables 3 Random vaiables A sample space S may be difficult to descibe if the elements of S ae not numbes discuss how we can use a ule by which an element s of S may be associated
More informationarxiv: v1 [math.co] 2 Feb 2018
A VERSION OF THE LOEBL-KOMLÓS-SÓS CONJECTURE FOR SKEWED TREES TEREZA KLIMOŠOVÁ, DIANA PIGUET, AND VÁCLAV ROZHOŇ axiv:1802.00679v1 [math.co] 2 Feb 2018 Abstact. Loebl, Komlós, and Sós conjectued that any
More informationConstruction Schemes for Fault-Tolerant Hamiltonian Graphs
Constuction Schemes fo Fault-Toleant Hamiltonian Gaphs Jeng-Jung Wang Depatment of Compute and Infomation Science, National Chiao Tung Univesity, Hsinchu, Taiwan 30050, Republic of China Chun-Nan Hung
More informationUpper Bounds for Tura n Numbers. Alexander Sidorenko
jounal of combinatoial theoy, Seies A 77, 134147 (1997) aticle no. TA962739 Uppe Bounds fo Tua n Numbes Alexande Sidoenko Couant Institute of Mathematical Sciences, New Yok Univesity, 251 Mece Steet, New
More informationMatrix Colorings of P 4 -sparse Graphs
Diplomabeit Matix Coloings of P 4 -spase Gaphs Chistoph Hannnebaue Januay 23, 2010 Beteue: Pof. D. Winfied Hochstättle FenUnivesität in Hagen Fakultät fü Mathematik und Infomatik Contents Intoduction iii
More informationA generalization of the Bernstein polynomials
A genealization of the Benstein polynomials Halil Ouç and Geoge M Phillips Mathematical Institute, Univesity of St Andews, Noth Haugh, St Andews, Fife KY16 9SS, Scotland Dedicated to Philip J Davis This
More informationThe inverse strong non-split r-domination number of a graph
MultiCaft Intenational Jounal of Engineeing, Science and Technology INTERNATIONAL JOURNAL OF ENGINEERING, SCIENCE AND TECHNOLOGY www.ijest-ng.com 2010 MultiCaft Limited. All ights eseved The invese stong
More informationCONSTRUCTION OF EQUIENERGETIC GRAPHS
MATCH Communications in Mathematical and in Compute Chemisty MATCH Commun. Math. Comput. Chem. 57 (007) 03-10 ISSN 0340-653 CONSTRUCTION OF EQUIENERGETIC GRAPHS H. S. Ramane 1, H. B. Walika * 1 Depatment
More informationBrief summary of functional analysis APPM 5440 Fall 2014 Applied Analysis
Bief summay of functional analysis APPM 5440 Fall 014 Applied Analysis Stephen Becke, stephen.becke@coloado.edu Standad theoems. When necessay, I used Royden s and Keyzsig s books as a efeence. Vesion
More informationCERFACS 42 av. Gaspard Coriolis, Toulouse, Cedex 1, France. Available at Date: April 2, 2008.
ON THE BLOCK TRIANGULAR FORM OF SYMMETRIC MATRICES IAIN S. DUFF and BORA UÇAR Technical Repot: No: TR/PA/08/26 CERFACS 42 av. Gaspad Coiolis, 31057 Toulouse, Cedex 1, Fance. Available at http://www.cefacs.f/algo/epots/
More informationThe Archimedean Circles of Schoch and Woo
Foum Geometicoum Volume 4 (2004) 27 34. FRUM GEM ISSN 1534-1178 The Achimedean Cicles of Schoch and Woo Hioshi kumua and Masayuki Watanabe Abstact. We genealize the Achimedean cicles in an abelos (shoemake
More informationA Short Combinatorial Proof of Derangement Identity arxiv: v1 [math.co] 13 Nov Introduction
A Shot Combinatoial Poof of Deangement Identity axiv:1711.04537v1 [math.co] 13 Nov 2017 Ivica Matinjak Faculty of Science, Univesity of Zageb Bijenička cesta 32, HR-10000 Zageb, Coatia and Dajana Stanić
More informationOn the Quasi-inverse of a Non-square Matrix: An Infinite Solution
Applied Mathematical Sciences, Vol 11, 2017, no 27, 1337-1351 HIKARI Ltd, wwwm-hikaicom https://doiog/1012988/ams20177273 On the Quasi-invese of a Non-squae Matix: An Infinite Solution Ruben D Codeo J
More informationSOME GENERAL NUMERICAL RADIUS INEQUALITIES FOR THE OFF-DIAGONAL PARTS OF 2 2 OPERATOR MATRICES
italian jounal of pue and applied mathematics n. 35 015 (433 44) 433 SOME GENERAL NUMERICAL RADIUS INEQUALITIES FOR THE OFF-DIAGONAL PARTS OF OPERATOR MATRICES Watheq Bani-Domi Depatment of Mathematics
More informationarxiv: v1 [math.co] 1 Apr 2011
Weight enumeation of codes fom finite spaces Relinde Juius Octobe 23, 2018 axiv:1104.0172v1 [math.co] 1 Ap 2011 Abstact We study the genealized and extended weight enumeato of the - ay Simplex code and
More informationAsymptotically Lacunary Statistical Equivalent Sequence Spaces Defined by Ideal Convergence and an Orlicz Function
"Science Stays Tue Hee" Jounal of Mathematics and Statistical Science, 335-35 Science Signpost Publishing Asymptotically Lacunay Statistical Equivalent Sequence Spaces Defined by Ideal Convegence and an
More informationarxiv: v1 [math.nt] 12 May 2017
SEQUENCES OF CONSECUTIVE HAPPY NUMBERS IN NEGATIVE BASES HELEN G. GRUNDMAN AND PAMELA E. HARRIS axiv:1705.04648v1 [math.nt] 12 May 2017 ABSTRACT. Fo b 2 and e 2, let S e,b : Z Z 0 be the function taking
More informationUsing Laplace Transform to Evaluate Improper Integrals Chii-Huei Yu
Available at https://edupediapublicationsog/jounals Volume 3 Issue 4 Febuay 216 Using Laplace Tansfom to Evaluate Impope Integals Chii-Huei Yu Depatment of Infomation Technology, Nan Jeon Univesity of
More informationOn a quantity that is analogous to potential and a theorem that relates to it
Su une quantité analogue au potential et su un théoème y elatif C R Acad Sci 7 (87) 34-39 On a quantity that is analogous to potential and a theoem that elates to it By R CLAUSIUS Tanslated by D H Delphenich
More informationFailure Probability of 2-within-Consecutive-(2, 2)-out-of-(n, m): F System for Special Values of m
Jounal of Mathematics and Statistics 5 (): 0-4, 009 ISSN 549-3644 009 Science Publications Failue Pobability of -within-consecutive-(, )-out-of-(n, m): F System fo Special Values of m E.M.E.. Sayed Depatment
More informationONE-POINT CODES USING PLACES OF HIGHER DEGREE
ONE-POINT CODES USING PLACES OF HIGHER DEGREE GRETCHEN L. MATTHEWS AND TODD W. MICHEL DEPARTMENT OF MATHEMATICAL SCIENCES CLEMSON UNIVERSITY CLEMSON, SC 29634-0975 U.S.A. E-MAIL: GMATTHE@CLEMSON.EDU, TMICHEL@CLEMSON.EDU
More informationStanford University CS259Q: Quantum Computing Handout 8 Luca Trevisan October 18, 2012
Stanfod Univesity CS59Q: Quantum Computing Handout 8 Luca Tevisan Octobe 8, 0 Lectue 8 In which we use the quantum Fouie tansfom to solve the peiod-finding poblem. The Peiod Finding Poblem Let f : {0,...,
More informationOn the Poisson Approximation to the Negative Hypergeometric Distribution
BULLETIN of the Malaysian Mathematical Sciences Society http://mathusmmy/bulletin Bull Malays Math Sci Soc (2) 34(2) (2011), 331 336 On the Poisson Appoximation to the Negative Hypegeometic Distibution
More informationA THREE CRITICAL POINTS THEOREM AND ITS APPLICATIONS TO THE ORDINARY DIRICHLET PROBLEM
A THREE CRITICAL POINTS THEOREM AND ITS APPLICATIONS TO THE ORDINARY DIRICHLET PROBLEM DIEGO AVERNA AND GABRIELE BONANNO Abstact. The aim of this pape is twofold. On one hand we establish a thee citical
More informationKOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS
Jounal of Applied Analysis Vol. 14, No. 1 2008), pp. 43 52 KOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS L. KOCZAN and P. ZAPRAWA Received Mach 12, 2007 and, in evised fom,
More informationMATH 415, WEEK 3: Parameter-Dependence and Bifurcations
MATH 415, WEEK 3: Paamete-Dependence and Bifucations 1 A Note on Paamete Dependence We should pause to make a bief note about the ole played in the study of dynamical systems by the system s paametes.
More informationAdditive Approximation for Edge-Deletion Problems
Additive Appoximation fo Edge-Deletion Poblems Noga Alon Asaf Shapia Benny Sudakov Abstact A gaph popety is monotone if it is closed unde emoval of vetices and edges. In this pape we conside the following
More informationOn the Number of Rim Hook Tableaux. Sergey Fomin* and. Nathan Lulov. Department of Mathematics. Harvard University
Zapiski Nauchn. Seminaov POMI, to appea On the Numbe of Rim Hook Tableaux Segey Fomin* Depatment of Mathematics, Massachusetts Institute of Technology Cambidge, MA 0239 Theoy of Algoithms Laboatoy SPIIRAN,
More informationWhen two numbers are written as the product of their prime factors, they are in factored form.
10 1 Study Guide Pages 420 425 Factos Because 3 4 12, we say that 3 and 4 ae factos of 12. In othe wods, factos ae the numbes you multiply to get a poduct. Since 2 6 12, 2 and 6 ae also factos of 12. The
More informationRelating Branching Program Size and. Formula Size over the Full Binary Basis. FB Informatik, LS II, Univ. Dortmund, Dortmund, Germany
Relating Banching Pogam Size and omula Size ove the ull Binay Basis Matin Saueho y Ingo Wegene y Ralph Wechne z y B Infomatik, LS II, Univ. Dotmund, 44 Dotmund, Gemany z ankfut, Gemany sauehof/wegene@ls.cs.uni-dotmund.de
More informationRELIABILITY is an important concept in the design
Poceedings of the Wold Congess on Engineeing 0 Vol I WCE 0, July -, 0, London, U.K. Reliability Measues in Ciculant Netwok *Inda Rajasingh, Bhaati Rajan, and R. Sundaa Rajan Abstact Reliability and efficiency
More informationLargest and smallest minimal percolating sets in trees
Lagest and smallest minimal pecolating sets in tees Eic Riedl Havad Univesity Depatment of Mathematics ebiedl@math.havad.edu Submitted: Sep 2, 2010; Accepted: Ma 21, 2012; Published: Ma 31, 2012 Abstact
More informationLacunary I-Convergent Sequences
KYUNGPOOK Math. J. 52(2012), 473-482 http://dx.doi.og/10.5666/kmj.2012.52.4.473 Lacunay I-Convegent Sequences Binod Chanda Tipathy Mathematical Sciences Division, Institute of Advanced Study in Science
More informationAnalytical Solutions for Confined Aquifers with non constant Pumping using Computer Algebra
Poceedings of the 006 IASME/SEAS Int. Conf. on ate Resouces, Hydaulics & Hydology, Chalkida, Geece, May -3, 006 (pp7-) Analytical Solutions fo Confined Aquifes with non constant Pumping using Compute Algeba
More informationConspiracy and Information Flow in the Take-Grant Protection Model
Conspiacy and Infomation Flow in the Take-Gant Potection Model Matt Bishop Depatment of Compute Science Univesity of Califonia at Davis Davis, CA 95616-8562 ABSTRACT The Take Gant Potection Model is a
More informationMultiple Criteria Secretary Problem: A New Approach
J. Stat. Appl. Po. 3, o., 9-38 (04 9 Jounal of Statistics Applications & Pobability An Intenational Jounal http://dx.doi.og/0.785/jsap/0303 Multiple Citeia Secetay Poblem: A ew Appoach Alaka Padhye, and
More informationarxiv: v2 [math.ag] 4 Jul 2012
SOME EXAMPLES OF VECTOR BUNDLES IN THE BASE LOCUS OF THE GENERALIZED THETA DIVISOR axiv:0707.2326v2 [math.ag] 4 Jul 2012 SEBASTIAN CASALAINA-MARTIN, TAWANDA GWENA, AND MONTSERRAT TEIXIDOR I BIGAS Abstact.
More informationA Multivariate Normal Law for Turing s Formulae
A Multivaiate Nomal Law fo Tuing s Fomulae Zhiyi Zhang Depatment of Mathematics and Statistics Univesity of Noth Caolina at Chalotte Chalotte, NC 28223 Abstact This pape establishes a sufficient condition
More informationCompactly Supported Radial Basis Functions
Chapte 4 Compactly Suppoted Radial Basis Functions As we saw ealie, compactly suppoted functions Φ that ae tuly stictly conditionally positive definite of ode m > do not exist The compact suppot automatically
More informationEncapsulation theory: radial encapsulation. Edmund Kirwan *
Encapsulation theoy: adial encapsulation. Edmund Kiwan * www.edmundkiwan.com Abstact This pape intoduces the concept of adial encapsulation, wheeby dependencies ae constained to act fom subsets towads
More informationFunctions Defined on Fuzzy Real Numbers According to Zadeh s Extension
Intenational Mathematical Foum, 3, 2008, no. 16, 763-776 Functions Defined on Fuzzy Real Numbes Accoding to Zadeh s Extension Oma A. AbuAaqob, Nabil T. Shawagfeh and Oma A. AbuGhneim 1 Mathematics Depatment,
More informationOn the integration of the equations of hydrodynamics
Uebe die Integation de hydodynamischen Gleichungen J f eine u angew Math 56 (859) -0 On the integation of the equations of hydodynamics (By A Clebsch at Calsuhe) Tanslated by D H Delphenich In a pevious
More informationMeasure Estimates of Nodal Sets of Polyharmonic Functions
Chin. Ann. Math. Se. B 39(5), 08, 97 93 DOI: 0.007/s40-08-004-6 Chinese Annals of Mathematics, Seies B c The Editoial Office of CAM and Spinge-Velag Belin Heidelbeg 08 Measue Estimates of Nodal Sets of
More informationSemicanonical basis generators of the cluster algebra of type A (1)
Semicanonical basis geneatos of the cluste algeba of type A (1 1 Andei Zelevinsky Depatment of Mathematics Notheasten Univesity, Boston, USA andei@neu.edu Submitted: Jul 7, 006; Accepted: Dec 3, 006; Published:
More informationUnobserved Correlation in Ascending Auctions: Example And Extensions
Unobseved Coelation in Ascending Auctions: Example And Extensions Daniel Quint Univesity of Wisconsin Novembe 2009 Intoduction In pivate-value ascending auctions, the winning bidde s willingness to pay
More informationf h = u, h g = v, we have u + v = f g. So, we wish
Answes to Homewok 4, Math 4111 (1) Pove that the following examples fom class ae indeed metic spaces. You only need to veify the tiangle inequality. (a) Let C be the set of continuous functions fom [0,
More informationPearson s Chi-Square Test Modifications for Comparison of Unweighted and Weighted Histograms and Two Weighted Histograms
Peason s Chi-Squae Test Modifications fo Compaison of Unweighted and Weighted Histogams and Two Weighted Histogams Univesity of Akueyi, Bogi, v/noduslód, IS-6 Akueyi, Iceland E-mail: nikolai@unak.is Two
More informationQUANTUM ALGORITHMS IN ALGEBRAIC NUMBER THEORY
QUANTU ALGORITHS IN ALGEBRAIC NUBER THEORY SION RUBINSTEIN-SALZEDO Abstact. In this aticle, we discuss some quantum algoithms fo detemining the goup of units and the ideal class goup of a numbe field.
More informationTHE CONE THEOREM JOEL A. TROPP. Abstract. We prove a fixed point theorem for functions which are positive with respect to a cone in a Banach space.
THE ONE THEOEM JOEL A. TOPP Abstact. We pove a fixed point theoem fo functions which ae positive with espect to a cone in a Banach space. 1. Definitions Definition 1. Let X be a eal Banach space. A subset
More informationCALCULUS II Vectors. Paul Dawkins
CALCULUS II Vectos Paul Dawkins Table of Contents Peface... ii Vectos... 3 Intoduction... 3 Vectos The Basics... 4 Vecto Aithmetic... 8 Dot Poduct... 13 Coss Poduct... 21 2007 Paul Dawkins i http://tutoial.math.lama.edu/tems.aspx
More information( ) [ ] [ ] [ ] δf φ = F φ+δφ F. xdx.
9. LAGRANGIAN OF THE ELECTROMAGNETIC FIELD In the pevious section the Lagangian and Hamiltonian of an ensemble of point paticles was developed. This appoach is based on a qt. This discete fomulation can
More informationON SPARSELY SCHEMMEL TOTIENT NUMBERS. Colin Defant 1 Department of Mathematics, University of Florida, Gainesville, Florida
#A8 INTEGERS 5 (205) ON SPARSEL SCHEMMEL TOTIENT NUMBERS Colin Defant Depatment of Mathematics, Univesity of Floida, Gainesville, Floida cdefant@ufl.edu Received: 7/30/4, Revised: 2/23/4, Accepted: 4/26/5,
More informationOLYMON. Produced by the Canadian Mathematical Society and the Department of Mathematics of the University of Toronto. Issue 9:2.
OLYMON Poduced by the Canadian Mathematical Society and the Depatment of Mathematics of the Univesity of Toonto Please send you solution to Pofesso EJ Babeau Depatment of Mathematics Univesity of Toonto
More informationTemporal-Difference Learning
.997 Decision-Making in Lage-Scale Systems Mach 17 MIT, Sping 004 Handout #17 Lectue Note 13 1 Tempoal-Diffeence Leaning We now conside the poblem of computing an appopiate paamete, so that, given an appoximation
More informationTo Feel a Force Chapter 7 Static equilibrium - torque and friction
To eel a oce Chapte 7 Chapte 7: Static fiction, toque and static equilibium A. Review of foce vectos Between the eath and a small mass, gavitational foces of equal magnitude and opposite diection act on
More informationLocalization of Eigenvalues in Small Specified Regions of Complex Plane by State Feedback Matrix
Jounal of Sciences, Islamic Republic of Ian (): - () Univesity of Tehan, ISSN - http://sciencesutaci Localization of Eigenvalues in Small Specified Regions of Complex Plane by State Feedback Matix H Ahsani
More informationConnectedness of Ordered Rings of Fractions of C(X) with the m-topology
Filomat 31:18 (2017), 5685 5693 https://doi.og/10.2298/fil1718685s Published by Faculty o Sciences and Mathematics, Univesity o Niš, Sebia Available at: http://www.pm.ni.ac.s/ilomat Connectedness o Odeed
More information