Semi-equivelar maps on the surface of Euler characteristic 1
|
|
- Rosamond Cooper
- 5 years ago
- Views:
Transcription
1 Note di Matematica ISSN -5, e-issn Note Mat. 7 (0) no., 9 0. doi:0.5/i59009v7np9 Semi-equivelar maps on the surface of Euler characteristic Anand Kumar Tiwari i Department of Applied Science, Indian Institute of Information Technology Allahabad Jhalwa, Allahabad 05, India anand@iiita.ac.in Ashish Kumar Upadhyay ii Department of Mathematics, Indian Institute of Technology Patna Bihata, Patna 0 0, India upadhyay@iitp.ac.in Received:..0; accepted:..0. Abstract. Semi-Equivelar maps are generalizations of Archimedean solids to surfaces other than the -sphere. In an earlier work a complete classification of semi-equivelar map of type ( 5, ) on the surface of Euler characteristic was given. Vertex transitive semi-equivelar maps on the double torus have been classified. In this article we study these types of maps on the surface of Euler characteristic. We classify them and show that none of them is vertex transitive. Keywords: vertex transitive maps, Archimedean solids, semi-equivelar Maps MSC 000 classification: primary 5B70, secondary 5C0 Introduction A triangulation of a surface is called d-covered if each edge of the triangulation is incident with a vertex of degree d. We got interested in studying the content presented in this article while attempting to answer a question of Negami and Nakamoto [] about existence of d-covered triangulations for closed surfaces. We had answered their question in affirmative [] for the surfaces of Euler characteristic 7 χ and further became interested in looking at what happens for surfaces with χ =. It was here that due to curvature considerations of this surface we had to construct a map on this surface which we named as Semi-equivelar map []. Such maps have also been studied in various forms (see [], [7,,, ]). In the meantime we came to learn that Nedela and Karabas [], [] have worked along similar lines and classified all the vertex transitive Archimedean maps on orientable surfaces of Euler characteristics, i This work is supported by a CSIR SRF (Award No. 09/0(000)/00-EMR-I) ii This work is partially supported by SERB, DST grant No. SR/S/MS:7/0 c 0 Università del Salento
2 9 A. K. Tiwari, A. K. Upadhyay and (see also [5]). In particular, they have shown that there are seventeen isomorphism classes of Archimedean maps on the orientable surface of Euler characteristic, out of which exactly fourteen are semi-equivelar maps with eleven distinct face sequences of types : ( 5, ), (, ), (, ), (,,, ), (, ), (,,, ), (,,, ), (, ), (,, ), (,, ), (, ). An orientable closed surface of Euler characteristic is the double cover of non orientable closed surface of Euler characteristic. This motivated us to explore the existence of above eleven types of semi-equivelar maps on non orientable surface of Euler characteristic. In the article [] we have classified the semi-equivelar map of type ( 5, ) on this surface. Here, we investigate the remaining types of semi-equivelar maps on this surface. In the next few paragraphs we describe the definitions and terminologies used in this article. These definitions and terminologies are given in [0] and we are giving them here for the sake of ready reference. A standard reference on the subject of polyhedral maps is the article [] of Brehm and Schulte. For graph theory related terminologies one may also refer to[] and for topological preliminaries and terminologies one may refer to [0]. Throughout this article the term graph will mean a finite simple graph. A cycle of length m or a m-cycle, usually denoted by C m, is by definition a connected -regular graph with m vertices. A -dimensional Polyhedral Complex K is a finite collection of m i -cycles, where {m i : i n and m i } N, together with vertices and edges of the cycles such that the non-empty intersection of any two cycles is either a vertex or is an edge. The cycles are called faces of K. The notations V (K) and EG(K) are used to denote the set of vertices and edges of K respectively. A geometric object, called geometric career of K, denoted by K can be associated to a polyhedral complex K in the following manner : corresponding to each m-cycle C m in K, consider a m-gon D m whose boundary cycle is C m. Then K is the union of all such m-gons. The complex K is said to be connected (resp. compact or orientable) if K is a connected (resp. compact or orientable) topological space. A polyhedral complex K is called a Polyhedral -manifold if for each vertex v the faces containing v are of the form C m,..., C mp where C m C m,... C mp C mp, and C mp C m are edges for some p. A connected polyhedral -manifold is called a Polyhedral Map. We will also use the term map for a polyhedral map. Among any two complexes K and K we define an isomorphism to be a bijective map f : V (K ) V (K ) for which f(σ) is a face in K if and only if σ is a face in K. If K = K then f is said to be an automorphism of K. The set of all automorphisms of a polyhedral complex K forms a group under the operation of composition of maps. This group is called the automorphism group of K. If this group acts transitively on the set V (K) then the complex is called a vertex transitive com-
3 Semi-equivelar maps of Euler characteristic 9 plex. Some vertex transitive maps of Euler characteristic 0 have been studied in [] and many others in [], [5], [], [] and []. The face sequence (see []) of a vertex v in a map is a finite cyclically ordered sequence (a p, b q,..., m r ) of powers of positive integers a, b,..., m and p, q,..., r, such that through the vertex v, p numbers of C a, q numbers of C b,..., r numbers of C m are incident in the given cyclic order. A map K is said to be Semi-Equivelar if face sequence of each vertex of K is same. A SEM with face sequence (a p, b q,..., m r ), is also called SEM of type (a p, b q,..., m r ). In [], maps with face sequence (, ) and (,,, ) have been considered. Let EG(K) be the edge graph of a map K and V (K) = {v, v,..., v n }. Let L K (v i ) = {v j V (K): v i v j EG(K)}. For 0 t n define a graph G t (K) with V (G t (K)) = V (K) and v i v j EG(G t (K)) if L K (v i ) L K (v j ) = t. In other words the number of elements in the set L K (v i ) L K (v j ) is t. This graph was introduced in [] by B. Datta. Moreover if K and K are two isomorphic maps then G i (K) = G i (K ) for each i. We have used these graphs in this article to determine whether two SEMs are isomorphic. In the article [] it has been shown that : Proposition. There are exactly three non isomorphic semi-equivelar maps of type ( 5, ) on the surface of Euler characteristic. In the present article we show : Lemma. If K is a semi-equivelar map of type (,,, ) on the surface of Euler characteristic, then K is isomorphic to K (,,, ) or K (,,, ), see the examples described in Section. Lemma. If M is a semi-equivelar map of type (,, ) on the surface of Euler characteristic, then M is isomorphic to M (,, ) or M (,, ), see the examples described in Section. Lemma. If N is a semi-equivelar map of type (, ) on the surface of Euler characteristic, then N is isomorphic to N (, ) or N (, ), see the examples described in Section. It has been shown further that the maps described in the above Lemmas are non-isomorphic, see Claim.,. in page 5. Considering this fact together with the above Proposition it follows that : Theorem. There are at least nine non-isomorphic semi-equivelar maps on the surface of Euler characteristic. In the article we also show that : Theorem. There exist no semi-equivelar maps of types (, ), (,,, ),
4 9 A. K. Tiwari, A. K. Upadhyay (,,, ), (, ) and (,, ) on the surface of Euler characteristic -. The article is organized in the following manner. In the next section, we present examples of semi-equivelar maps on the surface of Euler characteristic. In the section following it, we describe the results and their proofs. The technique of the proofs involve exhaustive search for the desired objects. This leads to a case by case considerations and enumeration of these objects. Since the verifications are routine in almost all cases we have given this completely in [] and only referred to this here. Examples: Semi-equivelar maps on the surface of Euler characteristic M (,, ) M (,, ) N (, ) K (,,, ) K (,,, ) N (, )
5 Semi-equivelar maps of Euler characteristic 95 Claim.. N (, ) N (, ) and K (,,, ) K (,,, ), also N (, ), N (, ), K (,,, ) and K (,,, ) are not vertex transitive. Proof. Consider the graphs EG(G (N (, ))) = {[0, 7], [, ], [, ], [, ], [5, ], [, ]}, EG(G (N (, ))) = {[, 5], [, ], [, ]}, EG(G (K (,,, ))) = C (, 0,,,,,,,, 5,, ) C (,, 9, 7, 0, 5) and EG(G (K (,,, ))) = C (0,,,,, 0,,, 0,, 5,,,,, 7, 9,, 5,, ). From these graphs and discussions in page it is evident that N (, ) N (, ) and K (,,, ) K (,,, ). Also from these graphs one can deduce that the above four maps are not vertex transitive. This proves the claim. Claim.. M (,, ) M (,, ) and M (,, ), M (,, ) are not vertex transitive. Proof. Let A(EG(M )) and A(EG(M )) denote the adjacency matrices associated to the edge graphs of M (,, ) and M (,, ), respectively. Let P (x) and P (x) denote the characteristic polynomials of A(EG(M )) and A(EG(M )) respectively. If the map M (,, ) and M (,, ) are isomorphic, then P (x) = P (x), (see []). We have (using Maple) : P (x) = x 7x + 5x 50x + 70x 0 x 9 + x x 799x 5 555x + 7x + 079x 095x 57597x x x x 7 005x + 75x x 0505x 7055x x + 957x 0 900x 707x x + 09x 70770x x + 00x + 055x 70050x 5905x x 9 + 0x 90x 7 097x + 055x 5 90x 959x + 7x 0x; P (x) = x 7x + x x + 70x 0 x 9 770x + x x 5x 5 905x + 9x + 05x 57x 755x x x 50500x x + 55x x 557x 7707x + 700x x 0 00x 5970x + 5x x 57907x x + 097x x x 59x 0 + 7x x 50x 7 05x + 999x x 0x + 0x. Therefore M (,, ) M (,, ). Also, we have EG(G 5 (M (,, ))) = EG (G 5 (M (,, ))) = C (0,,,,, 0,, ) C (,, 5, 7, 9,,, 5) C (,,,,,, 0, ) C (,,, 5, 7, 9,, ) C (, 5, 7, 9,,, 5, 7) C (0,,, 0,,,, ). Let
6 9 A. K. Tiwari, A. K. Upadhyay α Aut(M (,, )) such that α() = then α induces an automorphism on EG(G 5 (M (,, ))). So α({, 5}) = {0, }. This implies α() = 0 or. But from the links of and it is easy to see that α() 0. So we have α() =, this implies α() = and α(5) = 0. From α(5) 0 we get α() =. Now considering lk() and lk() and the map α(), we see that α() =, a contradiction. Thus there is no automorphism which maps to. Hence M (,, ) is not vertex transitive. Similarly for M (,, ) we get no automorphism such that α() =. This proves the Claim.. Enumeration of SEMs on the surface of Euler characteristic Considering the Euler characteristic equation, it is easy to see that semiequivelar maps of types (, ) and (, ) do not exist on the surface of Euler characteristic. As, in these cases the number of vertices required to complete a link of a vertex is bigger than the number of vertices of the SEMs. From the study of remaining eight types: (, ), (,,, ), (,,, ), (,,, ), (, ), (,, ), (,, ) and (, ), we show the following : Lemma. There exists no SEM of type (, ) on the surface of Euler characteristic. Proof. Let M be a SEM of type (, ) on the surface of Euler characteristic. The notation lk(i) = C 0 ([i, i, i, i, i 5, i, i 7 ], i, i 9, i 0 ) for the link of a vertex i will mean that [i, i, i 0 ], [i, i 9, i 0 ], [i, i, i 9 ], [i, i 7, i ] form triangular faces and [i, i, i, i, i, i 5, i, i 7 ] forms an octagonal face. If denotes the number of vertices in V (M), E(M) denotes the number of edges, T (M) denotes the number of triangular faces and O(M) denotes the number of octagonal faces in map M, respectively, then it is easy to see that E(M) = 5, T (M) = and O(M) = 5. By Euler s equation we get, = +( ), i.e. = + ( ). From the equation we see, if the map exists then =. Let V = V (M) = {0,,..., }. Now, we prove the lemma by exhaustive search for all M. Assume without loss of generality that lk(0) = C 0 ([,,,, 5,, 7],, 9, 0). This implies lk(7) = C 0 ([, 5,,,,, 0],, a, b) for a, b V. Observe that (a, b) {(0, 9), (, )}. In case (a, b) = (0, 9), considering lk(0) we see that lies in two octagonal faces, which is not allowed. In case (a, b) = (, ) we get lk(7) = C 0 ([0,,,,, 5, ],,, ), lk() = C 0 ([7, 0,,,,, 5],,, ), lk(5) = C 0 ([, 7, 0,,,, ],, 5, ), lk() = C 0 ([5,, 7, 0,,, ],,, ), lk() = C 0 ([, 5,, 7, 0,, ], 0,, ), lk() = C 0 ([,, 5,, 7, 0, ],,, 0) and lk() = C 0 ([,,, 5,, 7, 0], 0,, ). This implies lk() = C 0 ([9, c, d, e, f, g, h],, 7, 0) for c, d, e, f, g, h V. In this case we have (h, g) {(, ),
7 Semi-equivelar maps of Euler characteristic 97 (, )}. But for both the cases of (h, g) we see easily that no map exists, for detailed calculation we refer the readers to see []. This proves the lemma. Lemma 5. There exists no SEM of type (,,, ) on the surface of Euler characteristic. Proof. Let G be a SEM of type (,,, ) on the surface of Euler characteristic. The notation lk(i) = C ([i, i, i, i, i 5 ], i, i 7, i, i 9 ) for the link of i will mean that [i, i, i 9 ], [i, i 5, i ], [i, i, i 7 ] form triangular faces, [i, i 7, i, i 9 ] forms a quadrangular face and [i, i, i, i, i, i 5 ] forms a hexagonal face. Let denote the number of vertices in V (G). If E(G), T (G), Q(G) and H(G) denote the number of edges, number of triangular faces, number of quadrangular faces and number of hexagonal faces in the map G, respectively, then it is easy to see that E(G) = 5, T (G) =, Q(G) = and H(G) =. By Euler s equation we see, if the map exists then =. Let V = V (G) = {0,,..., }. Now, we prove the lemma by exhaustive search for all G. Assume that lk(0) = C ([,,,, 5],, 7,, 9) then lk(7) = C ([a, b, c, d, e],, 0, 9, ) or lk(7) = C ([, a, b, c, d], e,, 9, 0) for some a, b, c, d, e V. But, for both the cases we need more than twelve vertices to complete lk(7). This is not allowed. So the map does not exist. Lemma. There exists no SEM of type (,,, ) on the surface of Euler characteristic. Proof. Let E be a SEM of type (,,, ) on the surface of Euler characteristic. The notation lk(i) = C ([i, i, i, i, i 5 ], [i, i 7, i, i 9, i 0 ], i ) for the link of i will mean that [i, i 5, i ] forms a triangular face, [i, i, i, i 0 ] forms a quadrangular face and [i, i, i, i, i, i 5 ], [i, i, i 7, i, i 9, i 0 ] form hexagonal faces. Let denote the number of vertices in V (E). If E(E), T (E), Q(E) and H(E) denote the number of edges, number of triangular faces, number of quadrangular faces and number of hexagonal faces, respectively, then we see that E(E) =, T (E) =, Q(E) = and H(E) =. By Euler s equation we see, if the map exists then =. For this, let V = V (E) = {0,,..., }. Now, we prove the lemma by exhaustive search for all E. For this assume that lk(0) = C ([,,,, 5], [, 7,, 9, 0], ), then lk() = C ([0, 5,,, ], [a, b, c, d, ], 0) for some a, b, c, d V. Now, it is easy to see that lk() can not be completed, as a, b, c, d have no suitable values in V (E). Therefore the required map does not exist. Thus the lemma is proved. Lemma 7. There exists no SEM of type (, ) on the surface of Euler characteristic. Proof : Let F be a SEM of type (, ) on the surface of Euler characteristic. The notation lk(i) = C ([i, i, i, i, i 5 ], i, i 7, i, i 9, i 0 ) for the link of i will mean that [i, i, i 0, i 9 ], [i, i 5, i, i 7 ], [i, i 7, i, i 9 ] form quadrangular faces
8 9 A. K. Tiwari, A. K. Upadhyay and [i, i, i, i, i, i 5 ] forms a hexagonal face. Let denote the number of vertices in V (F ). If E(F ), Q(F ) and H(F ) denote the number of edges, number of quadrangular faces and number of hexagonal faces, respectively, then E(F ) =, Q(F ) = and H(F ) =. By Euler s equation we see if the map exists then =. For this, let V = V (F ) = {0,,..., }. Now we prove the lemma by exhaustive search for all F. Assume that lk(0) = C ([,,,, 5],, 7,, 9, 0). This implies, lk(7) = C ([b, c, d, e, ], 5, 0, 9,, a) or lk(7) = C ([b, c, d, e, ], 9, 0, 5,, a) for some a, b, c, d, e V. Then for both the cases of lk(7) we need more than twelve vertices to complete. But this is not allowed. So we do not get the required map. Thus the lemma is proved. Lemma. There exists no SEM of type (,, ) on the surface of Euler characteristic. Proof. Let M be a SEM of type (,, ) on the surface of Euler characteristic. The notation lk(i) = C ([i, i, i, i, i 5, i, i 7, i, i 9, i 0, i ], i, [i, i, i 5, i, i, i ]) for the link of i will mean that [i, i, i, i ], [i, i, i, i, i, i 5, i, i ] and [i, i, i, i, i, i 5, i, i 7, i, i 9, i 0, i ] form a -gonal, a -gonal and a -gonal faces. If, E(M), Q(M), O(M) and R(M) denote the number of vertices, number of edges, number of -gonal faces, number of -gonal faces and number of -gonal faces in M, respectively, then we see that E(M) =, Q(M) =, O(M) = and R(M) =. By Euler s equation we see, if the map exists then =. For this, let V = V (M) = {0,,..., }. Assume that lk(0) = C ([,,,, 5,, 7,, 9, 0, ],, [,, 5,,, ]). This implies lk() = C ([0,, 0, 9,, 7,, 5,,, ],, [,,, 5,, ]) and lk() = C ([,, 5,, 7,, 9, 0,, 0, ],, [, a, b, c, d, e]) for some a, b, c, d, e V. Observe that a {, 0}. If a = then b =, for otherwise deg() >. But, then appears in two octagonal faces, which is not allowed. So we have a = 0, this implies b {, }. If b = then c = and we get in two octagonal faces. So b =. This implies c {, }. In case c =, d =. This implies appears in two octagonal faces. If c = then d =, now we see that e has no suitable value in V so that lk() can be completed. So, the required map does not exist. Proof of Theorem. The proof of Theorem follows from Lemmas, 5,, 7 and. Proof of Lemma. Let K be a SEM of type (,,, ) on the surface of Euler characteristic. The notation lk(i) = C ([i, i, i, i, i 5, i, i 7 ], i, [i 9, i 0 ], i ) for the link of i will mean that [i, i 9, i 0 ] forms a triangular face, [i, i 7, i, i 9 ], [i, i, i, i 0 ] form quadrangular faces and [i, i, i, i, i, i 5, i, i 7 ] forms a octagonal face. Let denote the number of vertices in V (K). If E(K), T (K), Q(K) and O(K) denote the number of edges, number of triangular faces, number of quadrangular faces and number of octagonal faces in the map K, respectively,
9 Semi-equivelar maps of Euler characteristic 99 then we see that E(K) =, T (K) =, Q(K) = and H(K) =. By Euler s equation we see, if the map exists then =. Let V = V (K) = {0,,..., }. Now, we prove the result by exhaustive search for all K. Let lk(0) = C ([,,,, 5,, 7],, [9, 0], ), this implies lk(9) = C ([b, c, d, e, f, g, ], 7, [0, 0], a) and lk(0) = C ([, l, k, j, i, h, a],, [9, 0], ) for some a, b, c, d, e, f, g, h, i, j, k, l V. Observe that b = and a =, then octagonal faces of the map K are O = [0,,,,, 5,, 7], O = [, 9,, c, d, e, f, g] and O = [, 0,, l, k, j, i, h]. As these faces share no vertex with each other, successively we get c =, d = 5, e =, f =, g =, l =, k = 0, j =, i = and h =. This implies lk(9) = C ([,, 5,,,, ], 7, [0, 0], ), lk(0) = C ([,, 0,,,, ],, [9, 0], ) and lk() = C ([,,, 5,,, 9], 0, [7, x], y) for some x, y V. In this case, (x, y) {(, ), (, 0), (0, ), (0, ), (, 0), (, ), (, ), (, ), (, ), (, )}. If (x, y) = (, ) then considering lk() and lk() successively we see as an edge and a non-edge both. Also, (, 0) = (, ); (0, ) = (, ) and (0, ) = (, ) by the map (0, 9)(, )(, )(, 5)(, )(5, ) (, )(7, )(, )(, )(0, ); (0, ) = (, ) by the map (0, )(, )(, )(, )(, 5)(5, )(, )(7, 9)(0, ) (, )(, 0)(, ); (, ) = (, 0) by the map (0, )(, )(, )(, )(, 5)(5, )(, )(7, 9)(0, )(, 0)(, ). So, it is enough to search the map for (x, y) {(, ), (0, ), (0, ), (, )}. Case. If (x, y) = (, ) then constructing the map successively we get lk() = C ([,,, 5,,, 9], 0, [7, ], ), lk(7) = C ([0,,,,, 5, ], 0, [, ], 9), lk() = C ([0,,,,, 0, ],, [, 7], ), lk() = C ([, 0,,,,, 0], 0, [, ], ), lk() = C ([0, 7,, 5,,, ],, [, ], 0), lk() = C ([,, 5,,, 9, ],, [, ], ) and lk() = C ([5,,,,, 0, 7],, [0, m], n) for some m, n V. In this case, (m, n) {(, ), (, 5), (5, ), (5, ), (, 5), (, )}. If (m, n) = (, ) then considering lk() we see 5 as an edge and a non-edge both and, if (m, n) = (, 5) then considering lk() and lk(0) we see that lk() can not be completed. For the remaining values of (m, n), we have following subcases. When (m, n) = (5, ) then lk() = C ([5,,,,, 0, 7],, [0, 5], ), lk(5) = C ([,,,, 9,, ], 5, [, 0], ) and lk(0) = C ([,,,, 0,, ], 7, [, 5], ). This implies lk() = C ([,,, 0,,, 0], 5, [, o], p) for some o, p V. Observe that (o, p) {(, ), (, ), (, ), (, 5)}. In case (o, p) {(, ), (, )} considering lk(), lk() and lk() successively we see that lk() or lk() can not be completed. If (o, p) = (, ) then considering lk(), lk(), lk() successively we see that lk() can not be completed. If (o, p) = (, 5) then successively considering lk(), lk(5) and lk(), we get C 9 (9, 0,,, 0,,,, ) lk(). A contradiction. So,
10 00 A. K. Tiwari, A. K. Upadhyay (m, n) (5, ). Subcase.. If (m, n) = (, ) then successively we get K (,,, ) as given in Section. Subcase.. When (m, n) = (5, ) then we get an object which is isomorphic to K (,,, ), as given in Section, by the map (0,, 7, )(,,, )(, 0, 5, 0)(,,, )(,,, 9, 5,,, ). Consideration of other cases is a similar enumeration the details of which are given in []. We do not get any new object in this process. To save space we are hence referring the reader to [] for further details. Proof of Lemma. Let M be a SEM of type (,, ) on the surface of Euler characteristic. The notation lk(i) = C 0 ([i, i, i, i, i 5, i, i 7, i, i 9, i 0, i, i, i, i, i 5, i, i, i, i, i 0 ) for the link of i will mean that [i, i 5, i, i ], [i, i, i 0, i, i, i ] and [i, i, i, i, i, i 5, i, i 7, i, i 9, i 0, i, i, i, i, i 5 ] form a -gonal face, a -gonal face and a -gonal face, respectively. Let denote the number of vertices in V (M). If E(M), Q(M), H(M) and P (M) denote the number of edges, number of -gonal faces, number of -gonal faces and number of -gonal faces, respectively, then E(M) = and P (M) =, Q(M) =, H(M) =. By Euler s equation we see if the map exists then =. For this, let V = V (M) = {0,,..., 7}. Now we can prove the result by exhaustive search for all M. From a case by case consideration for different values of (c, d) similar to that of Lemma we get M and M as given in Section and we do not get any other object different than these. The detailed enumeration is given in []. To save space we are hence referring the reader to [] for further details. Proof of Lemma. Let N be a SEM of type (, ) on the surface of Euler characteristic. The notation lk(i) = C ([i, i, i, i, i 5, i, i 7 ], i, i 9, i 0, i, i, i, i ) for the link of i will mean that [i, i 7, i, i 9, i 0, i ], [i, i, i, i, i, i ] form hexagonal faces and [i, i, i, i, i, i 5, i, i 7 ] forms a octagonal face. If, E(N), H(N) and O(N) denote the number vertices, number of edges, the number of hexagonal faces and the number of octagonal faces in the map N, respectively, then E(N) =, H(N) = and O(N) =. Using Euler s equation we see that if the map exists then =. A case by case consideration similar to that of Lemma gives us N and N as given in Section. We do not get any other object different than these. The detailed enumeration of this is given in []. To save space we are hence referring the reader to [] for further details. These proofs are also available with authors and may be supplied if required. Acknowledgements. We are thankful to the anonymous referee for her/his suggestions and comments. This lead to a significant improvement in content
11 Semi-equivelar maps of Euler characteristic 0 of the article. The work reported here forms part of the PhD thesis of the first author. References [] Altshuler A., Brehm U.: The weakly neighborly polyhedral maps on the -manifolds with chi -, Discrete Comput. Geom.,, 55 9,. [] Brehm U., Kühnel W.: Equivelar maps on torus, Europ. J. Combi., 9,, 00. [] Brehm U., Schulte E.: Polyhedral maps, Handbook of Discrete and Computational Geometry, CRC Press: Boca Raton, 97. [] Babai L.: Vertex transitive graphs and vertex transitive maps, J. Graph Th., 5, 57-7, 9. [5] Datta B., Upadhyay A. K.: Degree-regular triangulation of torus and Klein bottle, Proc. Indian Acad. Sci., 5, 79 07, 005. [] Datta B., Upadhyay A. K.: Degree-regular triangulation of double torus, Forum Math.,, 0 05, 00. [7] Coxeter H. S. M., Moser W. O. J.: Generators and relations for discrete groups, Springer-Verlag: Berlin, 0. [] Conder M. D. E., Everitt B.: Regular maps on non-orientable surfaces, Geom. Dedicata, 5, 09, 95. [9] Conder M. D. E.: Regular maps and hyper maps of chi - to -00, J. Comb. Theory, 99, 55 59, 009. [0] Datta B.: A note on the existence of {k, k}-equivelar polyhedral maps, Beitr. Algebra Geom.,, 57 5, 005. [] Grünbaum B., Shephard G. C.: Tilings and patterns, W. H. Freeman and com.: New York, 7. [] Jones G. A., Singerman D.: Theory of maps on orientable surfaces, Proc. London Math. Soc., 7, 7 07, 7. [] Karabas J., Nedela R.: Archimedean solids of genus, Electronic Notes in Discrete Math.,, 9, 007. [] Karabas J., Nedela R.: Archimedean maps of higher genera, Mathematics of Comput.,, 59 5, 0. [5] Karabas J.: Archimedean solids, 0, karabas/science.html. [] Datta B., Nilakantan N.: Equivelar polyhedral with few vertices, Discrete Comput. Geom.,, 9, 00. [] Negami S., Nakamoto A.: Triangulations on closed surfaces covered by vertices of given degree, Graphs comb.,, 59 57, 00. [] Lutz F. H.: Triangulated manifolds with few vertices and vertex-transitive group actions, Shaker Verlag: Aachen, 99. [] Lutz F. H., Sulanke T., Tiwari A. K., Upadhyay, A. K.: Equivelar and d-covered triangulations of surfaces. I, arxiv:00.777, 00.
12 0 A. K. Tiwari, A. K. Upadhyay [0] Spanier E. H.: Algebraic topology, Springer-Verlag: New York,. [] Bondy J. A., Murthy U. S. R.: Graph theory, GTM, Springer, 00. [] Tiwari A. K., Upadhyay A. K.: Semi-equivelar maps on the torus and the Klein bottle with few vertices, Mathematica Slov., 7,, 0. [] Upadhyay A. K., Tiwari A. K.: Semi-Equivelar Maps on the surface of Euler characteristic -, arxiv:0.5, 0. [] Upadhyay A. K., Tiwari A. K., Maity D.: Semi-equivelar maps, Beitr Algebra Geom, 55, 9, 0.
13 Note di Matematica ISSN -5, e-issn Note Mat. 7 (0) no., 0. doi:0.5/i59009v7np0 Some companions of Ostrowski type inequalities for twice differentiable functions Hüseyin BUDAK Department of Mathematics, Faculty of Science and Arts, Düzce University, Düzce-Turkey hsyn.budak@gmail.com Mehmet Zeki SARIKAYA Department of Mathematics, Faculty of Science and Arts, Düzce University, Düzce-Turkey sarikayamz@gmail.com Received:..0; accepted:.9.0. Abstract. The main aim of this paper is to establish some companions of Ostrowski type integral inequalities for functions whose second derivatives are bounded. Moreover, some Ostrowski type inequalities are given for mappings whose first derivatives are of bounded variation. Some applications for special means and quadrature formulae are also given. Keywords: Function of bounded variation, Ostrowski type inequalities, Riemann-Stieltjes integral. MSC 000 classification: primary D5, A5 secondary D0, A55 Introduction In, Ostrowski [7] established a following useful inequality: Theorem. Let f : [a, b] R be a differentiable mapping on (a, b) whose derivative f : (a, b) R is bounded on (a, b), i.e. f := sup f (t) <. t (a,b) Then, we have the inequality for all x [a, b]. f(x) b a b a f(t)dt [ + ( x a+b (b a) ) ] (b a) f, (.) The constant is the best possible. Inequality (.) is referred to, in the literature, as the Ostrowski inequality. Numerous studies were devoted to extensions and generalizations of this inequality in both the integral and discrete case. For some examples, please refer to ([0], [], []-[], []-[5]) c 0 Università del Salento
arxiv: v1 [math.co] 3 Nov 2017
DEGREE-REGULAR TRIANGULATIONS OF SURFACES BASUDEB DATTA AND SUBHOJOY GUPTA arxiv:1711.01247v1 [math.co] 3 Nov 2017 Abstract. A degree-regular triangulation is one in which each vertex has identical degree.
More informationHamiltonian cycles in bipartite quadrangulations on the torus
Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple
More informationUNIFORM TILINGS OF THE HYPERBOLIC PLANE
UNIFORM TILINGS OF THE HYPERBOLIC PLANE BASUDEB DATTA AND SUBHOJOY GUPTA Abstract. A uniform tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex
More informationMirrors of reflections of regular maps
ISSN 1855-3966 (printed edn), ISSN 1855-3974 (electronic edn) ARS MATHEMATICA CONTEMPORANEA 15 (018) 347 354 https://doiorg/106493/1855-3974145911d (Also available at http://amc-journaleu) Mirrors of reflections
More informationarxiv: v1 [math.gt] 28 Feb 2009
Coverings and Minimal Triangulations of 3 Manifolds William Jaco, Hyam Rubinstein and Stephan Tillmann arxiv:0903.0112v1 [math.gt] 28 Feb 2009 Abstract This paper uses results on the classification of
More informationA Note on Vertex Arboricity of Toroidal Graphs without 7-Cycles 1
International Mathematical Forum, Vol. 11, 016, no. 14, 679-686 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/imf.016.667 A Note on Vertex Arboricity of Toroidal Graphs without 7-Cycles 1 Haihui
More informationEmbedding a graph-like continuum in some surface
Embedding a graph-like continuum in some surface R. Christian R. B. Richter G. Salazar April 19, 2013 Abstract We show that a graph-like continuum embeds in some surface if and only if it does not contain
More informationEuler s Theorem. Brett Chenoweth. February 26, 2013
Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s
More informationand Heinz-Jürgen Voss
Discussiones Mathematicae Graph Theory 22 (2002 ) 193 198 ON k-trestles IN POLYHEDRAL GRAPHS Michal Tkáč Department of Mathematics The Faculty of Business Economics in Košice University of Economics in
More informationCLASSIFICATION OF SURFACES
CLASSIFICATION OF SURFACES JUSTIN HUANG Abstract. We will classify compact, connected surfaces into three classes: the sphere, the connected sum of tori, and the connected sum of projective planes. Contents
More informationOn the packing chromatic number of some lattices
On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department
More informationA Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs
Applied Mathematics E-Notes, 15(015), 9-37 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ A Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs Naduvath
More informationFace two-colourable triangulations of K 13
Face two-colourable triangulations of K 13 M. J. Grannell, T. S. Griggs Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7 6AA UNITED KINGDOM M. Knor Department of Mathematics
More informationUniform edge-c-colorings of the Archimedean Tilings
Discrete & Computational Geometry manuscript No. (will be inserted by the editor) Uniform edge-c-colorings of the Archimedean Tilings Laura Asaro John Hyde Melanie Jensen Casey Mann Tyler Schroeder Received:
More informationON LOCAL STRUCTURE OF 1-PLANAR GRAPHS OF MINIMUM DEGREE 5 AND GIRTH 4
Discussiones Mathematicae Graph Theory 9 (009 ) 385 00 ON LOCAL STRUCTURE OF -PLANAR GRAPHS OF MINIMUM DEGREE 5 AND GIRTH Dávid Hudák and Tomáš Madaras Institute of Mathematics, Faculty of Sciences University
More information751 Problem Set I JWR. Due Sep 28, 2004
751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path
More informationON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE**
Chin. Ann. of Math. 23B:(2002),87-9. ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE** XU Changqing* DING Ren* Abstract The authors discuss the partition of a finite set of points in the plane
More informationON THE PACKING CHROMATIC NUMBER OF SEMIREGULAR POLYHEDRA
Acta Electrotechnica et Informatica, Vol., No., 0, 7, DOI: 0.478/v098-0-007-7 ON THE PACKING CHROMATIC NUMBER OF SEMIREGULAR POLYHEDRA Marián KLEŠČ, Štefan SCHRÖTTER Department of Mathematics and Theoretical
More information168 Butterflies on a Polyhedron of Genus 3
168 Butterflies on a Polyhedron of Genus 3 Douglas Dunham Department of Computer Science University of Minnesota, Duluth Duluth, MN 55812-2496, USA E-mail: ddunham@d.umn.edu Web Site: http://www.d.umn.edu/
More informationOn Sequential Topogenic Graphs
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 36, 1799-1805 On Sequential Topogenic Graphs Bindhu K. Thomas, K. A. Germina and Jisha Elizabath Joy Research Center & PG Department of Mathematics Mary
More informationEULER S FORMULA AND THE FIVE COLOR THEOREM
EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply
More informationCREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM. Dimitrios I. Dais
Séminaires & Congrès 6, 2002, p. 187 192 CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM by Dimitrios I. Dais Abstract. A necessary condition for the existence of torus-equivariant
More informationarxiv: v1 [math.mg] 13 Mar 2018
Characterizing face and flag vector pairs for polytopes Hannah Sjöberg Institut für Mathematik FU Berlin, Arnimallee 14195 Berlin, Germany sjoberg@math.fu-berlin.de Günter M. Ziegler Institut für Mathematik
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationLecture 5 CLASSIFICATION OF SURFACES
Lecture 5 CLASSIFICATION OF SURFACES In this lecture, we present the topological classification of surfaces. This will be done by a combinatorial argument imitating Morse theory and will make use of the
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 160 (2012) 505 512 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam 1-planarity of complete multipartite
More informationThe orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.
Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version
More informationPERFECT FOLDING OF THE PLANE
SOOCHOW JOURNAL OF MATHEMATICS Volume 32, No. 4, pp. 521-532, October 2006 PERFECT FOLDING OF THE PLANE BY E. EL-KHOLY, M. BASHER AND M. ZEEN EL-DEEN Abstract. In this paper we introduced the concept of
More informationRigidity of ball-polyhedra via truncated Voronoi and Delaunay complexes
!000111! NNNiiinnnttthhh IIInnnttteeerrrnnnaaatttiiiooonnnaaalll SSSyyymmmpppooosssiiiuuummm ooonnn VVVooorrrooonnnoooiii DDDiiiaaagggrrraaammmsss iiinnn SSSccciiieeennnccceee aaannnddd EEEnnngggiiinnneeeeeerrriiinnnggg
More informationPortraits of Groups on Bordered Surfaces
Bridges Finland Conference Proceedings Portraits of Groups on Bordered Surfaces Jay Zimmerman Mathematics Department Towson University 8000 York Road Towson, MD 21252, USA E-mail: jzimmerman@towson.edu
More informationSurfaces Beyond Classification
Chapter XII Surfaces Beyond Classification In most of the textbooks which present topological classification of compact surfaces the classification is the top result. However the topology of 2- manifolds
More informationON INDEX EXPECTATION AND CURVATURE FOR NETWORKS
ON INDEX EXPECTATION AND CURVATURE FOR NETWORKS OLIVER KNILL Abstract. We prove that the expectation value of the index function i f (x) over a probability space of injective function f on any finite simple
More informationAutomorphism Groups of Cyclic Polytopes
8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n
More informationAlgebra II: Review Exercises
: Review Exercises These notes reflect material from our text, A First Course in Abstract Algebra, Seventh Edition, by John B. Fraleigh, published by Addison-Wesley, 2003. Chapter 7. Advanced Group Theory
More informationarxiv: v1 [math.gr] 21 Sep 2018
PLANARITY OF CAYLEY GRAPHS OF GRAPH PRODUCTS OLGA VARGHESE arxiv:1809.07997v1 [math.gr] 21 Sep 2018 Abstract. We obtain a complete classification of graph products of finite abelian groups whose Cayley
More informationMath 210 Manifold III, Spring 2018 Euler Characteristics of Surfaces Hirotaka Tamanoi
Math 210 Manifold III, Spring 2018 Euler Characteristics of Surfaces Hirotaka Tamanoi 1. Euler Characteristic of Surfaces Leonhard Euler noticed that the number v of vertices, the number e of edges and
More informationThe Connectivity and Diameter of Second Order Circuit Graphs of Matroids
Graphs and Combinatorics (2012) 28:737 742 DOI 10.1007/s00373-011-1074-6 ORIGINAL PAPER The Connectivity and Diameter of Second Order Circuit Graphs of Matroids Jinquan Xu Ping Li Hong-Jian Lai Received:
More informationSubdivisions of Graphs: A Generalization of Paths and Cycles
Subdivisions of Graphs: A Generalization of Paths and Cycles Ch. Sobhan Babu and Ajit A. Diwan Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai 400076,
More informationThree applications of Euler s formula. Chapter 10
Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationVertex-Transitive Polyhedra of Higher Genus, I
Vertex-Transitive Polyhedra of Higher Genus, I Undine Leopold arxiv:1502.07497v1 [math.mg] 26 Feb 2015 Since Grünbaum and Shephard s investigation of self-intersection-free polyhedra with positive genus
More informationCombinatorial Enumeration of Partitions of a Convex Polygon
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 2015, Article 15.9.4 Combinatorial Enumeration of Partitions of a Convex Polygon Dong Zhang and Dongyi Wei Peking University Beijing 100871 P. R.
More informationPANCYCLICITY WHEN EACH CYCLE CONTAINS k CHORDS
Discussiones Mathematicae Graph Theory xx (xxxx) 1 13 doi:10.7151/dmgt.2106 PANCYCLICITY WHEN EACH CYCLE CONTAINS k CHORDS Vladislav Taranchuk Department of Mathematics and Statistics California State
More informationMATRIX INTEGRALS AND MAP ENUMERATION 1
MATRIX INTEGRALS AND MAP ENUMERATION 1 IVAN CORWIN Abstract. We explore the connection between integration with respect to the GUE and enumeration of maps. This connection is faciliated by the Wick Formula.
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationA Genus Bound for Digital Image Boundaries
A Genus Bound for Digital Image Boundaries Lowell Abrams and Donniell E. Fishkind March 9, 2005 Abstract Shattuck and Leahy [4] conjectured and Abrams, Fishkind, and Priebe [1],[2] proved that the boundary
More informationProduct Cordial Labeling for Some New Graphs
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 3, No. ; May 011 Product Cordial Labeling for Some New Graphs S K Vaidya (Corresponding author) Department of Mathematics, Saurashtra University
More informationExact discrete Morse functions on surfaces. To the memory of Professor Mircea-Eugen Craioveanu ( )
Stud. Univ. Babeş-Bolyai Math. 58(2013), No. 4, 469 476 Exact discrete Morse functions on surfaces Vasile Revnic To the memory of Professor Mircea-Eugen Craioveanu (1942-2012) Abstract. In this paper,
More informationREGULAR POLYGON SURFACES
REGULAR POLYGON SURFACES IAN ALEVY Abstract. A regular polygon surface M is a surface graph (Σ, Γ) together with a continuous map ψ from Σ into Euclidean 3-space which maps faces to regular polygons. When
More informationCombinatorial Tilings of the Sphere by Pentagons
Combinatorial Tilings of the Sphere by Pentagons Min Yan Department of Mathematics Hong Kong University of Science and Technology Kowloon, Hong Kong mamyan@ust.hk Submitted: Nov 16, 2012; Accepted: Mar
More informationarxiv: v1 [math.co] 15 Apr 2018
REGULAR POLYGON SURFACES IAN M. ALEVY arxiv:1804.05452v1 [math.co] 15 Apr 2018 Abstract. A regular polygon surface M is a surface graph (Σ, Γ) together with a continuous map ψ from Σ into Euclidean 3-space
More informationRigid Ball-Polyhedra in Euclidean 3-Space
Discrete Comput Geom (2013) 49:189 199 DOI 10.1007/s00454-012-9480-y Rigid Ball-Polyhedra in Euclidean 3-Space Károly Bezdek Márton Naszódi Received: 15 September 2011 / Revised: 30 September 2012 / Accepted:
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationA study on the Primitive Holes of Certain Graphs
A study on the Primitive Holes of Certain Graphs Johan Kok arxiv:150304526v1 [mathco] 16 Mar 2015 Tshwane Metropolitan Police Department City of Tshwane, Republic of South Africa E-mail: kokkiek2@tshwanegovza
More informationSharp lower bound for the total number of matchings of graphs with given number of cut edges
South Asian Journal of Mathematics 2014, Vol. 4 ( 2 ) : 107 118 www.sajm-online.com ISSN 2251-1512 RESEARCH ARTICLE Sharp lower bound for the total number of matchings of graphs with given number of cut
More informationGENERALIZED CPR-GRAPHS AND APPLICATIONS
Volume 5, Number 2, Pages 76 105 ISSN 1715-0868 GENERALIZED CPR-GRAPHS AND APPLICATIONS DANIEL PELLICER AND ASIA IVIĆ WEISS Abstract. We give conditions for oriented labeled graphs that must be satisfied
More informationEdge-disjoint Spanning Trees in Triangulated Graphs on Surfaces and application to node labeling 1
Edge-disjoint Spanning Trees in Triangulated Graphs on Surfaces and application to node labeling 1 Arnaud Labourel a a LaBRI - Universite Bordeaux 1, France Abstract In 1974, Kundu [4] has shown that triangulated
More informationGenerating Functions for Hyperbolic Plane Tessellations
Generating Functions for Hyperbolic Plane Tessellations by Jiale Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in
More informationK 4,4 e Has No Finite Planar Cover
K 4,4 e Has No Finite Planar Cover Petr Hliněný Dept. of Applied Mathematics, Charles University, Malostr. nám. 25, 118 00 Praha 1, Czech republic (E-mail: hlineny@kam.ms.mff.cuni.cz) February 9, 2005
More informationNotes on point set topology, Fall 2010
Notes on point set topology, Fall 2010 Stephan Stolz September 3, 2010 Contents 1 Pointset Topology 1 1.1 Metric spaces and topological spaces...................... 1 1.2 Constructions with topological
More informationOn vertex-degree restricted subgraphs in polyhedral graphs
Discrete Mathematics 256 (2002) 105 114 www.elsevier.com/locate/disc On vertex-degree restricted subgraphs in polyhedral graphs Igor Fabrici Department of Mathematics, Technical University Ilmenau, PF
More informationDominating Sets in Triangulations on Surfaces
Dominating Sets in Triangulations on Surfaces Hong Liu Department of Mathematics University of Illinois This is a joint work with Michael Pelsmajer May 14, 2011 Introduction A dominating set D V of a graph
More informationRAINBOW CONNECTION AND STRONG RAINBOW CONNECTION NUMBERS OF
RAINBOW CONNECTION AND STRONG RAINBOW CONNECTION NUMBERS OF Srava Chrisdes Antoro Fakultas Ilmu Komputer, Universitas Gunadarma srava_chrisdes@staffgunadarmaacid Abstract A rainbow path in an edge coloring
More informationarxiv: v1 [math.co] 17 Jan 2014
Regular matchstick graphs Sascha Kurz Fakultät für Mathematik, Physik und Informatik, Universität Bayreuth, Germany Rom Pinchasi Mathematics Dept., Technion Israel Institute of Technology, Haifa 2000,
More informationOn the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments
Electronic Journal of Graph Theory and Applications 3 (2) (2015), 191 196 On the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments Rafael Del Valle
More informationTwo Connections between Combinatorial and Differential Geometry
Two Connections between Combinatorial and Differential Geometry John M. Sullivan Institut für Mathematik, Technische Universität Berlin Berlin Mathematical School DFG Research Group Polyhedral Surfaces
More informationCoverings and minimal triangulations of 3 manifolds
Algebraic & Geometric Topology 11 (2011) 1257 1265 1257 Coverings and minimal triangulations of 3 manifolds WILLIAM JACO J HYAM RUBINSTEIN STEPHAN TILLMANN This paper uses results on the classification
More informationOn the number of distinct directions of planes determined by n points in R 3
On the number of distinct directions of planes determined by n points in R 3 Rom Pinchasi August 27, 2007 Abstract We show that any set of n points in R 3, that is not contained in a plane, determines
More informationTopological Invariance under Line Graph Transformations
Symmetry 2012, 4, 329-335; doi:103390/sym4020329 Article OPEN ACCESS symmetry ISSN 2073-8994 wwwmdpicom/journal/symmetry Topological Invariance under Line Graph Transformations Allen D Parks Electromagnetic
More informationMinimum congestion spanning trees of grids and discrete toruses
Minimum congestion spanning trees of grids and discrete toruses A. Castejón Department of Applied Mathematics I Higher Technical School of Telecommunications Engineering (ETSIT) Universidad de Vigo Lagoas-Marcosende
More informationOn a Triply Periodic Polyhedral Surface Whose Vertices are Weierstrass Points
Arnold Math J. DOI 10.1007/s40598-017-0067-9 RESEARCH CONTRIBUTION On a Triply Periodic Polyhedral Surface Whose Vertices are Weierstrass Points Dami Lee 1 Received: 3 May 2016 / Revised: 12 March 2017
More informationHomology of Simplicial Complexes
Homology of Simplicial Complexes Math, David Perkinson Introduction. This is an introduction to the homology of simplicial complexes suitable for a first course in linear algebra. It uses little more than
More informationEDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m
EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m GARY MACGILLIVRAY BEN TREMBLAY Abstract. We consider homomorphisms and vertex colourings of m-edge-coloured graphs that have a switching operation
More informationA TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3
A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 2769 2775 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Optimal acyclic edge colouring of grid like graphs
More informationarxiv: v2 [math.mg] 14 Nov 2012
arxiv:1211.2944v2 [math.mg] 14 Nov 2012 On the optimality of the ideal right-angled 24-cell ALEXANDER KOLPAKOV We prove that among four-dimensional ideal right-angled hyperbolic polytopes the 24-cell is
More informationFace Width and Graph Embeddings of face-width 2 and 3
Face Width and Graph Embeddings of face-width 2 and 3 Instructor: Robin Thomas Scribe: Amanda Pascoe 3/12/07 and 3/14/07 1 Representativity Recall the following: Definition 2. Let Σ be a surface, G a graph,
More informationRATIONAL CURVES ON SMOOTH CUBIC HYPERSURFACES. Contents 1. Introduction 1 2. The proof of Theorem References 9
RATIONAL CURVES ON SMOOTH CUBIC HYPERSURFACES IZZET COSKUN AND JASON STARR Abstract. We prove that the space of rational curves of a fixed degree on any smooth cubic hypersurface of dimension at least
More informationWinning Positions in Simplicial Nim
Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:
More informationAn Introduction to Belyi Surfaces
An Introduction to Belyi Surfaces Matthew Stevenson December 16, 2013 We outline the basic theory of Belyi surfaces, up to Belyi s theorem (1979, [1]), which characterizes these spaces as precisely those
More informationOptimization Problems Under One-sided (max, min)-linear Equality Constraints
WDS'12 Proceedings of Contributed Papers, Part I, 13 19, 2012. ISBN 978-80-7378-224-5 MATFYZPRESS Optimization Problems Under One-sided (max, min)-linear Equality Constraints M. Gad Charles University,
More informationTHE SOLUTION OF LENGTH THREE EQUATIONS OVER GROUPS
Proceedings of the Edinburgh Mathematical Society (1983) 26, 89-96 THE SOLUTION OF LENGTH THREE EQUATIONS OVER GROUPS by JAMES HOWIE* (Received 22nd September 1981) Let G be a group, and let r = r{t) be
More informationDomination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes
Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationarxiv: v2 [math.co] 23 Jan 2018
CONNECTIVITY OF CUBICAL POLYTOPES HOA THI BUI, GUILLERMO PINEDA-VILLAVICENCIO, AND JULIEN UGON arxiv:1801.06747v2 [math.co] 23 Jan 2018 Abstract. A cubical polytope is a polytope with all its facets being
More informationarxiv: v1 [math.at] 8 Jan 2015
HOMOLOGY GROUPS OF SIMPLICIAL COMPLEMENTS: A NEW PROOF OF HOCHSTER THEOREM arxiv:1501.01787v1 [math.at] 8 Jan 2015 JUN MA, FEIFEI FAN AND XIANGJUN WANG Abstract. In this paper, we consider homology groups
More informationBar k-visibility Graphs
Bar k-visibility Graphs Alice M. Dean Department of Mathematics Skidmore College adean@skidmore.edu William Evans Department of Computer Science University of British Columbia will@cs.ubc.ca Ellen Gethner
More informationExtremal Graph Theory: Turán s Theorem
Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini
More informationPETERSEN GRAPHS. Anna Benini and Anita Pasotti
Discussiones Mathematicae Graph Theory 35 (2015) 43 53 doi:10.7151/dmgt.1776 α-labelings OF A CLASS OF GENERALIZED PETERSEN GRAPHS Anna Benini and Anita Pasotti DICATAM - Sezione di Matematica Università
More informationDissections of polygons into convex polygons
Dissections of polygons into convex polygons Andrzej Żak Faculty of Applied Mathematics, AGH University of Science and Technology al. Mickiewicza 30, 30 059 Kraków, Poland e-mail: zakandrz@uci.agh.edu.pl
More informationTopic: Orientation, Surfaces, and Euler characteristic
Topic: Orientation, Surfaces, and Euler characteristic The material in these notes is motivated by Chapter 2 of Cromwell. A source I used for smooth manifolds is do Carmo s Riemannian Geometry. Ideas of
More informationNon-zero disjoint cycles in highly connected group labelled graphs
Non-zero disjoint cycles in highly connected group labelled graphs Ken-ichi Kawarabayashi Paul Wollan Abstract Let G = (V, E) be an oriented graph whose edges are labelled by the elements of a group Γ.
More informationChordal deletion is fixed-parameter tractable
Chordal deletion is fixed-parameter tractable Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de Abstract. It
More informationTrees. 3. (Minimally Connected) G is connected and deleting any of its edges gives rise to a disconnected graph.
Trees 1 Introduction Trees are very special kind of (undirected) graphs. Formally speaking, a tree is a connected graph that is acyclic. 1 This definition has some drawbacks: given a graph it is not trivial
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationRevisiting the bijection between planar maps and well labeled trees
Revisiting the bijection between planar maps and well labeled trees Daniel Cosmin Porumbel September 1, 2014 Abstract The bijection between planar graphs and well labeled trees was published by Cori and
More informationEccentric Coloring of a Graph
Eccentric Coloring of a Graph Medha Itagi Huilgol 1 & Syed Asif Ulla S. 1 Journal of Mathematics Research; Vol. 7, No. 1; 2015 ISSN 1916-9795 E-ISSN 1916-909 Published by Canadian Center of Science and
More informationMath 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem
Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem David Glickenstein November 26, 2008 1 Graph minors Let s revisit some de nitions. Let G = (V; E) be a graph. De nition 1 Removing
More informationA NOTE ON THE ASSOCIATED PRIMES OF THE THIRD POWER OF THE COVER IDEAL
A NOTE ON THE ASSOCIATED PRIMES OF THE THIRD POWER OF THE COVER IDEAL KIM KESTING, JAMES POZZI, AND JANET STRIULI Abstract. An algebraic approach to graph theory involves the study of the edge ideal and
More information