On Pathos Lict Subdivision of a Tree
|
|
- April Newton
- 5 years ago
- Views:
Transcription
1 International J.Math. Combin. Vol.4 (010), On Pathos Lict Subivision of a Tree Keerthi G.Mirajkar an Iramma M.Kaakol (Department of Mathematics, Karnatak Arts College, Dharwa , Karnataka, Inia) keerthi gm@yahoo.co.in, iramma.k@gmail.com Abstract: Let G be a graph an E 1 E(G). A Smaranachely E 1-lict graph n E 1 (G) of a graph G is the graph whose point set is the union of the set of lines in E 1 an the set of cutpoints of G in which two points are ajacent if an only if the corresponing lines of G are ajacent or the corresponing members of G are incient.here the lines an cutpoints of G are member of G. Particularly, if E 1 = E(G), a Smaranachely E(G)-lict graph n E(G) (G) is abbreviate to lict graph of G an enote by n(g). In this paper, the concept of pathos lict sub-ivision graph P n[s(t)] is introuce. Its stuy is concentrate only on trees. We present a characterization of those graphs, whose lict sub-ivision graph is planar, outerplanar, maximal outerplanar an minimally nonouterplanar. Further, we also establish the characterization for P n[s(t)] to be eulerian an hamiltonian. Key Wors: pathos, path number, Smaranachely lict graph, lict graph, pathos lict subivision graphs, Smaranache path k-cover, pathos point. AMS(010): 05C10, 05C99 1. Introuction The concept of pathos of a graph G was introuce by Harary [1] as a collection of minimum number of line isjoint open paths whose union is G. The path number of a graph G is the number of paths in a pathos. Stanton [7] an Harary [3] have calculate the path number for certain classes of graphs like trees an complete graphs. The subivision of a graph G is obtaine by inserting a point of egree in each line of G an is enote by S(G). The path number of a subivision of a tree S(T) is equal to K, where K is the number of o egree point of S(T). Also, the en points of each path of any pathos of S(T) are o points. The lict graph n(g) of a graph G is the graph whose point set is the union of the set of lines an the set of cutpoints of G in which two points are ajacent if an only if the corresponing lines of G are ajacent or the corresponing members of G are incient.here the lines an cutpoints of G are member of G. For any integer k 1, a Smaranache path k-cover of a graph G is a collection ψ of paths in G such that each ege of G is in at least one path of ψ an two paths of ψ have at most 1 Receive July 18, 010. Accepte December 5, 010.
2 On Pathos Lict Subivision of a Tree 101 k vertices in common. Thus if k = 1 an every ege of G is in exactly one path in ψ, then a Smaranache path k-cover of G is a simple path cover of G. See [8]. By a graph we mean a finite, unirecte graph without loops or multiple lines. We refer to the terminology of [1]. The pathos lict subivision of a tree T is enote as P n [S(T)] an is efine as the graph, whose point set is the union of set of lines, set of paths of pathos an set of cutpoints of S(T) in which two points are ajacent if an only if the corresponing lines of S(T) are ajacent an the line lies on the corresponing path P i of pathos an the lines are incient to the cutpoints. Since the system of path of pathos for a S(T) is not unique, the corresponing pathos lict subivision graph is also not unique. The pathos lict subivision graph is efine for a tree having at least one cutpoint. In Figure 1, a tree T an its subivision graph S(T), an their pathos lict subivision graphs P n [S(T)] are shown. e 1 e 4 c 1 e 3 c P 1 e e 5 P 3 P 1 P 3 e 1 e 4 c 1 e 3 c e e 5 P 1 P 1 P 3 e 1 e 4 c 1 e 3 c P 1 P 1 P 3 e e 5 T S(T) P n [S(T)] Figure 1 The line egree of a line uv in S(T) is the sum of the egrees of u an v. The pathos length is the number of lines which lies on a particular path P i of pathos of S(T). A penant pathos is a path P i of pathos having unit length which correspons to a penant line in S(T). A pathos point is a point in P n [S(T)] corresponing to a path of pathos of S(T). If G is planar graph,the innerpoint number i(g) of a graph G is the minimum number of vertices not belonging to the bounary of the exterior region in any embeing of the plane. A graph is sai to be minimally nonouterplanar if i(g) = 1 was given by [4].
3 10 Keerthi G.Mirajkar an Iramma M.Kaakol We nee the following for immeiate use. Remark 1.1 For any tree T, n[s(t)] is a subgraph of P n [S(T)]. Remark 1. For any tree T, T S(T). Remark 1.3 If the line egree of a nonpenant line in S(T) is o(even), the corresponig point in P n [S(T)] is of even(o) egree. Remark 1.4 The penant line in S(T) is always o egree an the corresponing point in P n [S(T)] is of o egree. Remark 1.5 For any tree T with C cutpoints, the number of cutpoints in n[s(t)] is equal to sum of the lines incient to C in T. Remark 1.6 For any tree T, the number of blocks in n[s(t)] is equal to the sum of the cutpoints an lines of T. Remark 1.7 n[s(t)] is connecte if an only if T is connecte. Theorem 1.1([5]) If G is a non trivial connecte (p, q) graph whose points have egree i an l i be the number of lines to which cutpoint C i belongs in G, then lict graph n(g) has q + C i points an q + [ i + l i ] lines. Theorem 1.([5]) The lict graph n(g) of a graph G is planar if an only if G is planar an the egree of each point is atmost 3. Theorem 1.3([]) Every maximal outerplanar graph G with p points has p 3 lines. Theorem 1.4([6]) A graph is a nonempty path if an only if it is a connecte graph with p points an i 4p + 6 = 0. Theorem 1.5([]) A graph G is eulerian if an only if every point of G is of even egree.. Pathos Lict Subivision Graph In the following Theorem we obtain the number of points an lines of P n [S(T)]. Theorem.1 For any (p, q) graph T, whose points have egree i an cutpoints C have egree C j, then the pathos lict sub-ivision graph P n [S(T)] has (3q +C +P i ) points an 1 i +4q + Cj lines. Proof By Theorem 1.1, n(t) has q + c points by subivision of T n(s(t))contains q + q + c points an by Remark 1.1, P n S(T) will contain 3q + c + P i points, where P i is the path number. By the efinition of n(t), it follows that L(T) is a subgraph of n(t). Also, subgraphs of L(T) are line-isjoint subgraphs of n[s(t)] whose union is L(T) an the cutpoints c of T having egree C j are also the members of n[s(t)]. Hence this implies that n[s(t)] contains q + 1 i + c j lines. Apart from these lines every subivision of T generates
4 On Pathos Lict Subivision of a Tree 103 a line an a cutpoint c of egree. This creates q + q lines in n[s(t)]. Thus n[s(t)] has 1 i + c j + q lines. Further, the pathos contribute q lines to P n S(T). Hence P n [S(T)] contains 1 i + c j + 4qlines. Corollary.1 For any (p, q) graph T, the number of regions in P n [S(T)] is (p + q) Planar Pathos Lict Sub-ivision Graph In this section we obtain the conition for planarity of pathos. Theorem 3.1 P n [S(T)] of a tree T is planar if an only if (T) 3. Proof Suppose P n [S(T)] is planar. Assume (T) 4. Let v be a point of egree 4 in T. By Remark 1.1, n(s(t)) is a subgraph of P n [S(T)] an by Theorem 1., P n [S(T)] is non-planar. Clearly, P n [S(T)] is non-planar, a contraiction. Conversely, suppose (T) 3. By Theorem 1., n[s(t)] is planar. Further each block of n[s(t)] is either K 3 or K 4. The pathos point is ajacent to atmost two vertices of each block of n[s(t)]. This gives a planar P n [S(T)]. We next give a characterization of trees whose pathos lict subivision of trees are outerplanar an maximal outerplanar. Theorem 3. The pathos lict sub-ivision graph P n [S(T)] of a tree T is outerplanar if an only if (T). Proof Suppose P n [S(T)] is outerplanar. Assume T has a point v of egree 3. The lines incient to v an the cut-point v form K 4 as a subgraph in n[s(t)]. Hence P n [S(T)] is non-outerplanar, a contraiction. Conversely, suppose T is a path P m of length m 1, by efinition each block of n[s(t)] is K 3 an n[s(t)] has m 1 blocks. Also, S(T) has exactly one path of pathos an the pathos point is ajacent to atmost two points of each block of n[s(t)]. The pathos point together with each block form m 1 number of K 4 x subgraphs in P n [S(T)]. Hence P n [S(T)] is outerplanar. Theorem 3.3 The pathos lict sub-ivision graph P n [S(T)] of a tree T is maximal outerplanar if an only if. Proof Suppose P n [S(T)] is maximal outerplanar. Then P n [S(T)] is connecte. Hence by Remark 1.7, T is connecte. Suppose P n [S(T)] is K 4 x, then clearly, T is K. Let T be any connecte tree with p > points, q lines an having path number k an C cut-points. Then clearly, P n [S(T)] has 3q+k+C points an 1 i +4q+ C j lines. Since P n [S(T)] is maximal
5 104 Keerthi G.Mirajkar an Iramma M.Kaakol outerplanar, by Theorem 1.3, it has [(3q + k + C) 3] lines. Hence 1 i + 4q + C j = [(3q + k + C) 3] = [(3(p 1) + k + C) 3] = 6p 6 + k + C 3 = 6p + k + C 9. But for k = 1, i + 8q + C j = 1p + 4C , i + C j = 4p + 4C 6, i + C j 4p 4C + 6 = 0. Since every cut-point is of egree two in a path, we have, Cj = C. Therefore i + 6 4p = 4C xc = 0. Hence i + 6 4p = 0. By Theorem 1.4, it follows that T is a non-empty path. Conversely, Suppose T is a non-empty path. We now prove that P n [S(T)] is maximal outerplanar by inuction on the number of points ( ). Suppose T is K. Then P n [S(T)] = K 4 x. Hence it is maximal outerplanar. As the inuctive hypothesis, let the pathos lict subivision of a non-empty path P with n points be maximal outerplanar. We now show that P n [S(T)] of a path P with n + 1 points is maximal outerplanar. First we prove that it is outerplanar. Let the point an line sequence of the path P be v 1, e 1, v, e, v 3, e 3,..., v n, e n, v n+1. P, S(P ) an P n [S(P )] are shown in Figure. Without loss of generality, P v n+1 = P. By inuctive hypothesis P n [S(P)] is maximal outerplanar. Now the point v n+1 is one point more in P n [S(P )] than in P n [S(P)]. Also there are only eight lines (e n 1, e n), (e n 1, e n 1), (e n 1, e n ), (e n, R), (e n, e n), (e n, C n), (C n, e n), (e n, R) more in P n [S(P )]. Clearly, the inuce subgraph on the points e n 1, C n 1, e n, e n, C n, R is not K 4. Hence P n [S(P )] is outerplanar. We now prove P n [S(P )] is maximal outerplanar. Since P n [S(P)] is maximal outerplanar, it has (3q + C + 1) 3 lines. The outerplanar graph P n [S(P )] has (3q + C + 1) lines = [3(q + 1) + (C+) + 1] 3 lines. By Theorem 1.3, P n [S(P )] is maximal outerplanar. Theorem 3.4 For any tree T, P n [S(T)] is minimally nonouterplanar if an only if (T) 3 an T has a unique point of egree 3. Proof Suppose P n [S(T)] is minimally non-outerplanar. Assume (T) > 3. By Theorem 3.1, P n [S(T)] is nonplanar, a contraiction. Hence (T) 3. Assume (T) < 3. By Theorem 3., P n [S(T)] is outerplanar, a contraiction. Thus (T) = 3. Assume there exist two points of egree 3 in T. Then n[s(t)] has at least two blocks as K 4. Any pathos point of S(T) is ajacent to atmost two points of each block in n[s(t)] which gives i(p n [S(T)]) > 1, a contraiction. Hence T has exactly one point point of egree 3.
6 On Pathos Lict Subivision of a Tree 105 Conversely, suppose every point of T has egree 3 an has a unique point of egree 3, then n[s(t)] has exactly one block as K 4 an remaining blocks are K 3 s. Each pathos point is ajacent to atmost two points of each block. Hence i(p n [S(T)]) = 1. e 1 e e n 1 e n P : v1 v v 3 v n 1 v n v n+1 S(P ) : e 1 c 1 e c 1 e c 1 e c c n c n 1 v 1 v v 1 v v 3 v n 1 v n 1 c n 1 c n en 1 e n 1 e n e n v n v n v n+1 c 1 c 1 c c n 1 c n 1 c n P n [S(P )] : e 1 e 1 e e e n 1 e n 1 e n e n R Figure 4. Traversability in Pathos Lict Subivision of a Tree In this section, we characterize the trees whose P n [S(T)] is eulerian an hamiltonian. Theorem 4.1 For any non-trivial tree T, the pathos lict subivision of a tree is non-eulerian. Proof Let T be a non-trivial tree. Remark 1.4 implies P n [S(T)] always contains a point of o egree. Hence by Theorem 1.5, the result follows. Theorem 4. The pathos lict subivision P n [S(T)] of a tree T is hamiltonian if an only if every cut-point of T is even of egree.
7 106 Keerthi G.Mirajkar an Iramma M.Kaakol Proof If T =, then P n [S(T)] is K 4 x. If T is a tree with p 3 points. Suppose P n [S(T)] is hamiltonian. Assume that T has at least one cut-point v of o egree m. Then G = K 1,m is a subgraph of T. Clearly, n(s(k 1,m )) = K m+1, together with each point of K m incient to a line of K 3. In number of path of pathos of S(T) there exist at least one path of pathos P i such that it begins with the cut-point v of S(T). In P n [S(T)] each pathos point is ajacent to exactly two points of K m. Further the pathos beginning with the cut-point v of S(T) is ajacent to exactly one point of K m in n(s(t)). Hence this creates a cut-point in P n [S(T)], a contraiction. Conversely, suppose every cut-point of T is even. Then every path of pathos starts an ens at penant points of T. We consier the following cases. Case 1 If T has only cut-points of egree two. Clearly, T is a path. Further S(T) is also a path with p + q points an has exactly one path of pathos. Let T = P l, v 1, v,, v l is a path. Now S(T):v 1, v 1, v, v,, v l 1, v l for all v i V [S(P l )] such that v i v i = e i, v i v i+1 = e i are consecutive lines an for all e i, e i E[S(P n)]. Further V [n(s(t))]={e 1, e 1, e, e,, e i, e i } {C 1, C 1, C, C,, C i } where,(c 1, C 1, C, C,, C i ) are cut-points of S(T). Since each block is a triangle in n(s(t)) an each block consist of points as B 1 = (e 1 C 1 e 1 ), B = (e C e ),, B m = (e i C i e i ). In P n[s(t)], the pathos point w is ajacent to e 1, e 1, e, e,, e i, e i. Hence, P n [S(T)]= e 1, e 1, e, e,, e i, e i (C 1, C 1, C, C,, C i ) w form a cycle as we 1C 1 e 1 C 1e C e e i w containing all the points of P n[s(t)].hence P n [S(T)] is hamiltonian. Case If T has all cut-points of even egree an is not a path. we consier the following subcases of this case. Subcase.1. If T has exactly one cut-point v of even egree m, v = (T) an is K 1,m. Clearly, S(K 1,m ) = F, such that E(F)={e 1, e 1, e, e,, e q, e q}. Now n(f) contains point set as {e 1, e 1, e, e,, e q, e q } {v, C 1, C, C 3,, C q }. For S[K 1,m], it has m paths of pathos with pathos point as P 1,,, P m. By efinition of n[s(t)], each pathos point is ajacent to exactly two points of n(s(t)). Also, V [P n [S(T)]]={e 1, e 1, e, e,, e q, e q } {v, C 1, C, C 3,, C q } {P 1,,, P m }. Then there exist a cycle containing all the points of n[s(t)] as P 1, e 1, C 1, e 1, v, e, C, e,,, P m, e q 1, C q 1, e q 1, e q, C q, e q, P 1. Subcase.. Assume T has more than one cut-point of even egree. Then in n(s(t)) each block is complete an every cut-point lies on exactly two blocks of n(s(t)). Let V [n(s(t))]={e 1, e 1, e, e,, e q, e q } {C 1, C,, C i } {C 1, C, C 3,, C q } {P 1,,, P j }. But each P j is ajacent to exactly two point of the block B j except {C 1, C,, C i } {C 1, C, C 3,, C q} an all these points together form a hamiltonian cycle of the type, {P 1, e 1, C 1, e 1, v, e, C, e,,, P r, e k, C k, e k, e k+1, C k+1, e k+1, P r+1,, P j, e q 1, C q 1, e q 1, e q, C q, e q, P 1 }. Hence P n [S(T)] is hamiltonian. References [1] Harary. F, Annals of New York, Acaemy of Sciences,(1974)175.
8 On Pathos Lict Subivision of a Tree 107 [] Harary. F, Graph Theory, Aison-Wesley, Reaing, Mass,1969. [3] Harary F an Schwenik A.J, Graph Theory an Computing, E.Rea R.C, Acaemic press, New York,(197). [4] Kulli V.R, Proceeings of the Inian National Science Acaemy, 61(A),(1975), 75. [5] Kulli V.R an Muebihal M.H, J. of Analysis an computation,vol, No.1(006), 33. [6] Kulli V.R, The Maths Eucation, (1975),9. [7] Stanton R.G, Cowan D.D an James L.O, Proceeings of the louisiana conference on combinatorics, Graph Theory an Computation (1970), 11. [8] S. Arumugam an I. Sahul Hami, International J.Math.Combin. Vol.3,(008),
On Direct Sum of Two Fuzzy Graphs
International Journal of Scientific an Research Publications, Volume 3, Issue 5, May 03 ISSN 50-353 On Direct Sum of Two Fuzzy raphs Dr. K. Raha *, Mr.S. Arumugam ** * P. & Research Department of Mathematics,
More informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
More informationCombinatorica 9(1)(1989) A New Lower Bound for Snake-in-the-Box Codes. Jerzy Wojciechowski. AMS subject classification 1980: 05 C 35, 94 B 25
Combinatorica 9(1)(1989)91 99 A New Lower Boun for Snake-in-the-Box Coes Jerzy Wojciechowski Department of Pure Mathematics an Mathematical Statistics, University of Cambrige, 16 Mill Lane, Cambrige, CB2
More informationLecture 22. Lecturer: Michel X. Goemans Scribe: Alantha Newman (2004), Ankur Moitra (2009)
8.438 Avance Combinatorial Optimization Lecture Lecturer: Michel X. Goemans Scribe: Alantha Newman (004), Ankur Moitra (009) MultiFlows an Disjoint Paths Here we will survey a number of variants of isjoint
More informationCO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH
An. Şt. Univ. Ovidius Constanţa Vol. 19(1), 011, 3 36 CO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH K. NAGARAJAN and A. NAGARAJAN Abstract A decomposition of a graph G is a collection ψ of edge-disjoint
More informationHilbert functions and Betti numbers of reverse lexicographic ideals in the exterior algebra
Turk J Math 36 (2012), 366 375. c TÜBİTAK oi:10.3906/mat-1102-21 Hilbert functions an Betti numbers of reverse lexicographic ieals in the exterior algebra Marilena Crupi, Carmela Ferró Abstract Let K be
More informationHKBU Institutional Repository
Hong Kong Baptist University HKBU Institutional Repository Department of Mathematics Journal Articles Department of Mathematics 2003 Extremal k*-cycle resonant hexagonal chains Wai Chee Shiu Hong Kong
More informationThe Wiener Index of Trees with Prescribed Diameter
011 1 15 4 ± Dec., 011 Operations Research Transactions Vol.15 No.4 The Wiener Inex of Trees with Prescribe Diameter XING Baohua 1 CAI Gaixiang 1 Abstract The Wiener inex W(G) of a graph G is efine as
More informationOn the Atom-Bond Connectivity Index of Cacti
Filomat 8:8 (014), 1711 1717 DOI 10.98/FIL1408711D Publishe by Faculty of Sciences an Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the Atom-Bon Connectivity Inex
More informationA CHARACTRIZATION OF GRAPHS WITH 3-PATH COVERINGS AND THE EVALUATION OF THE MINIMUM 3-COVERING ENERGY OF A STAR GRAPH WITH M RAYS OF LENGTH 2
A CHARACTRIZATION OF GRAPHS WITH -PATH COVERINGS AND THE EVALUATION OF THE MINIMUM -COVERING ENERGY OF A STAR GRAPH WITH M RAYS OF LENGTH PAUL AUGUST WINTER DEPARTMENT OF MATHEMATICS, UNIVERSITY OF KWAZULU
More informationarxiv: v1 [math.co] 13 Dec 2017
The List Linear Arboricity of Graphs arxiv:7.05006v [math.co] 3 Dec 07 Ringi Kim Department of Mathematical Sciences KAIST Daejeon South Korea 344 an Luke Postle Department of Combinatorics an Optimization
More informationThe eccentric-distance sum of some graphs
Electronic Journal of Graph Theory an Applications 5 (1) (017), 51 6 The eccentric-istance sum of some graphs Pamapriya P., Veena Matha Department of Stuies in Mathematics University of Mysore, Manasagangotri
More informationIMFM Institute of Mathematics, Physics and Mechanics Jadranska 19, 1000 Ljubljana, Slovenia. Preprint series Vol. 50 (2012), 1173 ISSN
IMFM Institute of Mathematics, Physics an Mechanics Jaransa 19, 1000 Ljubljana, Slovenia Preprint series Vol. 50 (2012), 1173 ISSN 2232-2094 PARITY INDEX OF BINARY WORDS AND POWERS OF PRIME WORDS Alesanar
More informationThe Complexity of Recognizing Tough Cubic Graphs
The Complexity of Recognizing Tough Cubic Graphs D. auer 1 J. van en Heuvel 2 A. Morgana 3 E. Schmeichel 4 1 Department of Mathematical Sciences, Stevens Institute of Technology Hoboken, NJ 07030, U.S.A.
More informationRelatively Prime Uniform Partitions
Gen. Math. Notes, Vol. 13, No., December, 01, pp.1-1 ISSN 19-7184; Copyright c ICSRS Publication, 01 www.i-csrs.org Available free online at http://www.geman.in Relatively Prime Uniform Partitions A. Davi
More informationSecure sets and defensive alliances faster algorithm and improved bounds. Amano, Kazuyuki; Oo, Kyaw May; Otach Author(s) Uehara, Ryuhei
JAIST Reposi https://space.j Title Secure sets an efensive alliances faster algorithm an improve bouns Amano, Kazuyuki; Oo, Kyaw May; Otach Author(s Uehara, Ryuhei Citation IEICE Transactions on Information
More informationarxiv: v1 [math.co] 15 Sep 2015
Circular coloring of signe graphs Yingli Kang, Eckhar Steffen arxiv:1509.04488v1 [math.co] 15 Sep 015 Abstract Let k, ( k) be two positive integers. We generalize the well stuie notions of (k, )-colorings
More informationWitt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread]
Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5: Aroun the integrality criterion 9.93 [version 1.1 21 April 2013, not complete, not proofrea In [1, section 9.93, Hazewinkel states
More informationLecture 5. Symmetric Shearer s Lemma
Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationOn colour-blind distinguishing colour pallets in regular graphs
J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
More informationHomotopy colimits in model categories. Marc Stephan
Homotopy colimits in moel categories Marc Stephan July 13, 2009 1 Introuction In [1], Dwyer an Spalinski construct the so-calle homotopy pushout functor, motivate by the following observation. In the category
More informationThe chromatic number of graph powers
Combinatorics, Probability an Computing (19XX) 00, 000 000. c 19XX Cambrige University Press Printe in the Unite Kingom The chromatic number of graph powers N O G A A L O N 1 an B O J A N M O H A R 1 Department
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationDECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS
DECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS ARNAUD BODIN Abstract. We state a kin of Eucliian ivision theorem: given a polynomial P (x) an a ivisor of the egree of P, there exist polynomials h(x),
More informationInternational Journal of Pure and Applied Mathematics Volume 35 No , ON PYTHAGOREAN QUADRUPLES Edray Goins 1, Alain Togbé 2
International Journal of Pure an Applie Mathematics Volume 35 No. 3 007, 365-374 ON PYTHAGOREAN QUADRUPLES Eray Goins 1, Alain Togbé 1 Department of Mathematics Purue University 150 North University Street,
More informationZachary Scherr Math 503 HW 3 Due Friday, Feb 12
Zachary Scherr Math 503 HW 3 Due Friay, Feb 1 1 Reaing 1. Rea sections 7.5, 7.6, 8.1 of Dummit an Foote Problems 1. DF 7.5. Solution: This problem is trivial knowing how to work with universal properties.
More informationThree-Variable Bracket Polynomial for Two-Bridge Knots
Three-Variable Bracket Polynomial for Two-Brige Knots Matthew Overuin Research Experience for Unergrauates California State University, San Bernarino San Bernarino, CA 92407 August 23, 2013 Abstract In
More informationTOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
English NUMERICAL MATHEMATICS Vol14, No1 Series A Journal of Chinese Universities Feb 2005 TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH He Ming( Λ) Michael K Ng(Ξ ) Abstract We
More informationIterated Point-Line Configurations Grow Doubly-Exponentially
Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection
More informationArticle On the Additively Weighted Harary Index of Some Composite Graphs
mathematics Article On the Aitively Weighte Harary Inex of Some Composite Graphs Behrooz Khosravi * an Elnaz Ramezani Department of Pure Mathematics, Faculty of Mathematics an Computer Science, Amirkabir
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationOn non-antipodal binary completely regular codes
Discrete Mathematics 308 (2008) 3508 3525 www.elsevier.com/locate/isc On non-antipoal binary completely regular coes J. Borges a, J. Rifà a, V.A. Zinoviev b a Department of Information an Communications
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationAsymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs
Asymptotic etermination of ege-banwith of multiimensional gris an Hamming graphs Reza Akhtar Tao Jiang Zevi Miller. Revise on May 7, 007 Abstract The ege-banwith B (G) of a graph G is the banwith of the
More informationOn the factorization of polynomials over discrete valuation domains
DOI: 10.2478/auom-2014-0023 An. Şt. Univ. Oviius Constanţa Vol. 22(1),2014, 273 280 On the factorization of polynomials over iscrete valuation omains Doru Ştefănescu Abstract We stuy some factorization
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationDEBRUIJN-LIKE SEQUENCES AND THE IRREGULAR CHROMATIC NUMBER OF PATHS AND CYCLES
DEBRUIJN-LIKE SEQUENCES AND THE IRREGULAR CHROMATIC NUMBER OF PATHS AND CYCLES MICHAEL FERRARA, CHRISTINE LEE, PHIL WALLIS DEPARTMENT OF MATHEMATICAL AND STATISTICAL SCIENCES UNIVERSITY OF COLORADO DENVER
More information7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then
7. Localization To prove Theorem 6.1 it becomes necessary to be able to a enominators to rings (an to moules), even when the rings have zero-ivisors. It is a tool use all the time in commutative algebra,
More informationOn Pairs of Disjoint Dominating Sets in a Graph
International Journal of Mathematical Analysis Vol 10, 2016, no 13, 623-637 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma20166343 On Pairs of Disjoint Dominating Sets in a Graph Edward M Kiunisala
More informationMcMaster University. Advanced Optimization Laboratory. Title: The Central Path Visits all the Vertices of the Klee-Minty Cube.
McMaster University Avance Optimization Laboratory Title: The Central Path Visits all the Vertices of the Klee-Minty Cube Authors: Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky AvOl-Report
More informationHamiltonian Spectra of Trees
Hamiltonian Spectra of Trees Daphne Der-Fen Liu Department of Mathematics California State University, Los Angeles Los Angeles, CA 90032, USA Email: dliu@calstatela.edu September 2006 (Revised: December
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationJournal of Algebra. A class of projectively full ideals in two-dimensional Muhly local domains
Journal of Algebra 32 2009 903 9 Contents lists available at ScienceDirect Journal of Algebra wwwelseviercom/locate/jalgebra A class of projectively full ieals in two-imensional Muhly local omains aymon
More informationExact distance graphs of product graphs
Exact istance graphs of prouct graphs Boštjan Brešar a,b Nicolas Gastineau c Sani Klavžar a,b, Olivier Togni c August 31, 2018 a Faculty of Natural Sciences an Mathematics, University of Maribor, Slovenia
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More information6 General properties of an autonomous system of two first order ODE
6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x
More informationON THE CORE OF A GRAPHf
ON THE CORE OF A GRAPHf By FRANK HARARY and MICHAEL D. PLUMMER [Received 8 October 1965] 1. Introduction Let G be a graph. A set of points M is said to cover all the lines of G if every line of G has at
More informationEfficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Efficient Construction of Semilinear Representations of Languages Accepte by Unary NFA Zeněk Sawa Center for Applie Cybernetics, Department of Computer Science Technical University of Ostrava 17. listopau
More informationVariable Independence and Resolution Paths for Quantified Boolean Formulas
Variable Inepenence an Resolution Paths for Quantifie Boolean Formulas Allen Van Geler http://www.cse.ucsc.eu/ avg University of California, Santa Cruz Abstract. Variable inepenence in quantifie boolean
More informationOPTIMAL CONTROL PROBLEM FOR PROCESSES REPRESENTED BY STOCHASTIC SEQUENTIAL MACHINE
OPTIMA CONTRO PROBEM FOR PROCESSES REPRESENTED BY STOCHASTIC SEQUENTIA MACHINE Yaup H. HACI an Muhammet CANDAN Department of Mathematics, Canaale Onseiz Mart University, Canaale, Turey ABSTRACT In this
More informationarxiv: v1 [math.co] 3 Jul 2018
On the number of coloure triangulations of -manifols Guillaume Chapuy CNRS, RF UMR 843, Université Paris-Dierot, France. Guillem Perarnau School of Mathematics, University of Birmingham, Unite Kingom.
More informationCMSC 858F: Algorithmic Game Theory Fall 2010 BGP and Interdomain Routing
CMSC 858F: Algorithmic Game Theory Fall 2010 BGP an Interomain Routing Instructor: Mohamma T. Hajiaghayi Scribe: Yuk Hei Chan November 3, 2010 1 Overview In this lecture, we cover BGP (Borer Gateway Protocol)
More informationEdge Fixed Steiner Number of a Graph
International Journal of Mathematical Analysis Vol. 11, 2017, no. 16, 771-785 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.7694 Edge Fixed Steiner Number of a Graph M. Perumalsamy 1,
More informationPartitioning a graph into highly connected subgraphs
Partitioning a graph into highly connected subgraphs Valentin Borozan 1,5, Michael Ferrara, Shinya Fujita 3 Michitaka Furuya 4, Yannis Manoussakis 5, Narayanan N 5,6 and Derrick Stolee 7 Abstract Given
More informationMARTIN HENK AND MAKOTO TAGAMI
LOWER BOUNDS ON THE COEFFICIENTS OF EHRHART POLYNOMIALS MARTIN HENK AND MAKOTO TAGAMI Abstract. We present lower bouns for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of
More informationk-difference cordial labeling of graphs
International J.Math. Combin. Vol.(016), 11-11 k-difference cordial labeling of graphs R.Ponraj 1, M.Maria Adaickalam and R.Kala 1.Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-6741,
More informationTHE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS
Discussiones Mathematicae Graph Theory 27 (2007) 507 526 THE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS Michael Ferrara Department of Theoretical and Applied Mathematics The University
More informationSome properties of random staircase tableaux
Some properties of ranom staircase tableaux Sanrine Dasse Hartaut Pawe l Hitczenko Downloae /4/7 to 744940 Reistribution subject to SIAM license or copyright; see http://wwwsiamorg/journals/ojsaphp Abstract
More informationOn the Expansion of Group based Lifts
On the Expansion of Group base Lifts Naman Agarwal, Karthekeyan Chanrasekaran, Alexanra Kolla, Vivek Maan July 7, 015 Abstract A k-lift of an n-vertex base graph G is a graph H on n k vertices, where each
More informationThe Dominating Graph DG bcd (G) of a Graph G
The Dominating Grah (G) of a Grah G M. Bhanumathi 1, J. John Flavia 2 1 Associate Professor, Government Arts College for Women, Pudukkottai, TN, India 2 Research Scholar, Government Arts College for Women,
More informationTHE SPECTRUM OF INFINITE REGULAR LINE GRAPHS
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 352, Number 1, Pages 115 132 S 0002-9947(99)02497-6 Article electronically publishe on July 1, 1999 THE SPECTRUM OF INFINITE REGULAR LINE GRAPHS
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationarxiv: v1 [math.co] 17 Feb 2011
On Gromov s Metho of Selecting Heavily Covere Points Jiří Matoušek a,b Uli Wagner b, c August 16, 2016 arxiv:1102.3515v1 [math.co] 17 Feb 2011 Abstract A result of Boros an Fürei ( = 2) an of Bárány (arbitrary
More informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
More informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
More informationWhy Bernstein Polynomials Are Better: Fuzzy-Inspired Justification
Why Bernstein Polynomials Are Better: Fuzzy-Inspire Justification Jaime Nava 1, Olga Kosheleva 2, an Vlaik Kreinovich 3 1,3 Department of Computer Science 2 Department of Teacher Eucation University of
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationA new proof of the sharpness of the phase transition for Bernoulli percolation on Z d
A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition
More informationFractional and circular 1-defective colorings of outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 6() (05), Pages Fractional and circular -defective colorings of outerplanar graphs Zuzana Farkasová Roman Soták Institute of Mathematics Faculty of Science,
More informationThe planar Chain Rule and the Differential Equation for the planar Logarithms
arxiv:math/0502377v1 [math.ra] 17 Feb 2005 The planar Chain Rule an the Differential Equation for the planar Logarithms L. Gerritzen (29.09.2004) Abstract A planar monomial is by efinition an isomorphism
More informationOn the Cauchy Problem for Von Neumann-Landau Wave Equation
Journal of Applie Mathematics an Physics 4 4-3 Publishe Online December 4 in SciRes http://wwwscirporg/journal/jamp http://xoiorg/436/jamp4343 On the Cauchy Problem for Von Neumann-anau Wave Equation Chuangye
More informationarxiv: v2 [math.st] 29 Oct 2015
EXPONENTIAL RANDOM SIMPLICIAL COMPLEXES KONSTANTIN ZUEV, OR EISENBERG, AND DMITRI KRIOUKOV arxiv:1502.05032v2 [math.st] 29 Oct 2015 Abstract. Exponential ranom graph moels have attracte significant research
More information2 Definitions We begin by reviewing the construction and some basic properties of squeezed balls and spheres [5, 7]. For an integer n 1, let [n] denot
Squeezed 2-Spheres and 3-Spheres are Hamiltonian Robert L. Hebble Carl W. Lee December 4, 2000 1 Introduction A (convex) d-polytope is said to be Hamiltonian if its edge-graph is. It is well-known that
More informationThe average number of spanning trees in sparse graphs with given degrees
The average number of spanning trees in sparse graphs with given egrees Catherine Greenhill School of Mathematics an Statistics UNSW Australia Syney NSW 05, Australia cgreenhill@unsweuau Matthew Kwan Department
More informationHamilton cycles and closed trails in iterated line graphs
Hamilton cycles and closed trails in iterated line graphs Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 USA Iqbalunnisa, Ramanujan Institute University of Madras, Madras
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationList of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2,
List of Theorems Mat 416, Introduction to Graph Theory 1. Ramsey s Theorem for graphs 8.3.11. Theorem 1 The numbers R(p, q) exist and for p, q 2, R(p, q) R(p 1, q) + R(p, q 1). If both summands on the
More informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationMinimum degree conditions for the existence of fractional factors in planar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 72(3) (2018), Pages 536 548 Minimum degree conditions for the existence of fractional factors in planar graphs P. Katerinis Department of Informatics, Athens
More informationON THE DISTANCE BETWEEN SMOOTH NUMBERS
#A25 INTEGERS (20) ON THE DISTANCE BETWEEN SMOOTH NUMBERS Jean-Marie De Koninc Département e mathématiques et e statistique, Université Laval, Québec, Québec, Canaa jm@mat.ulaval.ca Nicolas Doyon Département
More informationPlanar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4)
S-72.2420/T-79.5203 Planarity; Edges and Cycles 1 Planar Graphs (1) Topological graph theory, broadly conceived, is the study of graph layouts. Contemporary applications include circuit layouts on silicon
More informationOn the number of isolated eigenvalues of a pair of particles in a quantum wire
On the number of isolate eigenvalues of a pair of particles in a quantum wire arxiv:1812.11804v1 [math-ph] 31 Dec 2018 Joachim Kerner 1 Department of Mathematics an Computer Science FernUniversität in
More informationSimilar Operators and a Functional Calculus for the First-Order Linear Differential Operator
Avances in Applie Mathematics, 9 47 999 Article ID aama.998.067, available online at http: www.iealibrary.com on Similar Operators an a Functional Calculus for the First-Orer Linear Differential Operator
More informationLIAISON OF MONOMIAL IDEALS
LIAISON OF MONOMIAL IDEALS CRAIG HUNEKE AND BERND ULRICH Abstract. We give a simple algorithm to ecie whether a monomial ieal of nite colength in a polynomial ring is licci, i.e., in the linkage class
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationEnumeration of unrooted odd-valent regular planar maps
Enumeration of unroote o-valent regular planar maps Zhicheng Gao School of Mathematics an Statistics Carleton University Ottawa, Ontario Canaa K1S 5B6 zgao@math.carleton.ca Valery A. Lisovets Institute
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More informationThe Lefthanded Local Lemma characterizes chordal dependency graphs
The Lefthanded Local Lemma characterizes chordal dependency graphs Wesley Pegden March 30, 2012 Abstract Shearer gave a general theorem characterizing the family L of dependency graphs labeled with probabilities
More informationPartitioning a graph into highly connected subgraphs
Partitioning a graph into highly connected subgraphs Valentin Borozan 1,5, Michael Ferrara, Shinya Fujita 3 Michitaka Furuya 4, Yannis Manoussakis 5, Narayanan N 6 and Derrick Stolee 7 Abstract Given k
More informationarxiv: v1 [math.co] 22 Jan 2018
arxiv:1801.07025v1 [math.co] 22 Jan 2018 Spanning trees without adjacent vertices of degree 2 Kasper Szabo Lyngsie, Martin Merker Abstract Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that
More informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
More informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
More informationBOUNDS ON THE FIBONACCI NUMBER OF A MAXIMAL OUTERPLANAR GRAPH
BOUNDS ON THE FIBONACCI NUMBER OF A MAXIMAL OUTERPLANAR GRAPH Ahmad Fawzi Alameddine Dept. of Math. Sci., King Fahd University of Petroleum and Minerals, Dhahran 11, Saudi Arabia (Submitted August 1) 1.
More informationThe Case of Equality in the Dobrushin Deutsch Zenger Bound
The Case of Equality in the Dobrushin Deutsch Zenger Boun Stephen J Kirklan Department of Mathematics an Statistics University of Regina Regina, Saskatchewan CANADA S4S 0A2 Michael Neumann Department of
More informationTree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationOn graphs having a unique minimum independent dominating set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(3) (2017), Pages 357 370 On graphs having a unique minimum independent dominating set Jason Hedetniemi Department of Mathematical Sciences Clemson University
More information