Path Embeddings with Prescribed Edge in the Balanced Hypercube Network
|
|
- Ernest York
- 5 years ago
- Views:
Transcription
1 S S smmetr Communication Path Embeddings with Prescribed Edge in the Balanced Hpercube Network Dan Chen, Zhongzhou Lu, Zebang Shen, Gaofeng Zhang, Chong Chen and Qingguo Zhou * School of Information Science and Engineering, Lanzhou Universit, Lanzhou, Gansu , China; chend13@lzu.edu.cn (D.C.); luzhzh15@lzu.edu.cn (Z.L.); shenzb12@lzu.edu.cn (Z.S.); zhanggaof@lzu.edu.cn (G.Z.); chench2013@lzu.edu.cn (C.C.) * Correspondence: zhouqg@lzu.edu.cn Academic Editor: Angel Garrido Received: 21 Februar 2017; Accepted: 15 Ma 2017; Published: 26 Ma 2017 Abstract: The balanced hpercube network, which is a novel interconnection network for parallel computation and data processing, is a newl-invented variant of the hpercube. The particular feature of the balanced hpercube is that each processor has its own backup processor and the are connected to the same neighbors. A Hamiltonian bipartite graph with bipartition V 0 V 1 is Hamiltonian laceable if there eists a path between an two vertices V 0 and V 1. It is known that each edge is on a Hamiltonian ccle of the balanced hpercube. In this paper, we prove that, for an arbitrar edge e in the balanced hpercube, there eists a Hamiltonian path between an two vertices and in different partite sets passing through e with e =. This result improves some known results. Kewords: interconnection network; balanced hpercube; Hamiltonian path; passing prescribed edge; data processing 1. Introduction Interconnection networks pla an essential role in the performance of parallel and distributed sstems. In the event of practice, large multi-processor sstems can also be adopted as tools to address comple management and big data problems. It is well-known that an interconnection network is generall modeled b an undirected graph, in which processors are represented b vertices and communication links between them are represented b edges. The hpercube network is recognized as one of the most popular interconnection networks, and it has gained great attention and recognition from researchers both in graph theor and computer science. Nevertheless, the hpercube also has some shortcomings. For eample, its diameter is large. Therefore, man variants of the hpercube have been put forward [1 10] to improve performance of the hpercube in some aspects. Among these variants, the balanced hpercube has the following special properties: each verte of the balanced has a backup (matching) verte and the have the same neighborhood. Therefore, the backup verte can undertake tasks that originall run on a fault verte. It has been proved that the diameter of an odd-dimensional balanced hpercube BH n is 2n 1 [10], which is smaller than that of the hpercube Q 2n. With regard to the special properties discussed above, the balanced hpercube has been investigated b man researchers. Huang and Wu [11] studied the problem of resource placement of the balanced hpercube. Xu et al. [12] showed that the balanced hpercube is edge-pancclic and Hamiltonian laceable. It is found that the balanced hpercube is bipanconnected for all n 1 b Yang [13]. Huang et al. [14] discussed area efficient laout problems of the balanced hpercube. Yang [15] determined super (edge) connectivit of the balanced hpercube. Lü et al. studied (conditional) matching preclusion, hper-hamiltonian laceabilit, matching etendabilit and etra connectivit of the balanced hpercube in [16 19], respectivel. Some smmetric properties of the Smmetr 2017, 9, 79; doi: /sm
2 Smmetr 2017, 9, 79 2 of 12 balanced hpercube are presented in [20,21]. As stated above, the balanced hpercube possesses some desirable properties that the hpercube does not have, so it is interesting to eplore other favorable properties that the balanced hpercube ma have. Since parallel applications such as image and signal processing are originall designed on arra and ring architectures, it is important to have path and ccle embeddings in a network. Especiall, Hamiltonian path and ccle embeddings and other properties of famous networks are etensivel studied b man authors [12,13,22 26]. Xu et al. [12] proved that each edge of the balanced hpercube is on a ccle of even length from 4 to 4 n, that is, the balanced hpercube is edge-bipancclic. The also showed that the balanced hpercube is Hamiltonian laceable for all integers n 1. Recentl, Lü et al. [17] further obtained that the balanced hpercube is hper-hamiltonian laceable for all integers n 1. The rest of this paper is organized as follows. Some necessar definitions are presented as preliminaries in Section 2. The main result of this paper is shown in Section 3. Finall, conclusions are given in Section Preliminaries Let G = (V, E) be a simple undirected graph, where V is a verte-set of G and E is an edge-set of G. A path P from to v n is a sequence of vertices v n from to v n such that ever pair of consecutive vertices are adjacent and all vertices are distinct ecept for and v n. We also denote the path P = v n b, P, v n. The length of a path P is the number of edges in P, denoted b l(p). A ccle is a path with at least three vertices such that the first verte is the same as the last one. A graph is bipartite if its verte-set can be partitioned into two subsets V 0 and V 1 such that each edge has its ends in different subsets. A graph is Hamiltonian if it possesses a spanning ccle. A graph is Hamiltonian connected if there eists a Hamiltonian path joining an two vertices of it. Obviousl, an bipartite graph is not Hamiltonian connected. Simmons [27] proposed Hamiltonian laceabilit of bipatite graphs: a bipartite graph G = (V 0 V 1, E) is Hamiltonian laceable if there eists a Hamiltonian path between an two vertices and in different partite sets of G. A graph G is hper-hamiltonian laceable if it is Hamiltonian laceable and, for an verte v V i (i {0, 1}), there eists a Hamiltonian path in G v between an pair of vertices in V 1 i. For the graph definitions and notations not mentioned here, we refer the readers to [28,29]. Wu and Huang [10] gave the following definition of BH n as follows. Definition 1. An n-dimensional balanced hpercube, denoted b BH n, consists of 4 n vertices labelled b (a 0, a 1,..., a n 1 ), where a i {0, 1, 2, 3} for each 0 i n 1. An verte (a 0,..., a i 1, a i, a i+1,..., a n 1 ) with 1 i n 1 of BH n has the following 2n neighbors: 1. ((a 0 + 1) mod 4, a 1,..., a i 1, a i, a i+1,..., a n 1 ), ((a 0 1) mod 4, a 1,..., a i 1, a i, a i+1,..., a n 1 ), and 2. ((a 0 + 1) mod 4, a 1,..., a i 1, (a i + ( 1) a 0) mod 4, a i+1,..., a n 1 ), ((a 0 1) mod 4, a 1,..., a i 1, (a i + ( 1) a 0) mod 4, a i+1,..., a n 1 ).
3 Smmetr 2017, 9, 79 3 of 12 In BH n, the first coordinate a 0 of verte (a 0,..., a i,..., a n 1 ) is called the inner inde and the other coordinates are known as the a i (1 i n 1) i-dimensional inde. Clearl, each verte in BH n has two inner neighbors, and 2n 2 other neighbors. Note that all of the arithmetic operations on indices of vertices in BH n are four-modulated. BH 1 and BH 2 are illustrated in Figures 1 and 2, respectivel Figure 1. BH 1. ( 0,0) ( 1,0) ( 0,1) ( 1,1) ( 3,0) ( 2,0) ( 3,1) ( 2,1) ( 0,3) ( 1,3) ( 0,2) ( 1,2) ( 3,3) ( 2,3) ( 3,2) ( 2,2) Figure 2. BH 2. In the following, we give some basic properties of BH n. Proposition 1. [10] The balanced hpercube is bipartite. Proposition 2. [10,20] The balanced hpercube is verte-transitive and edge-transitive. Proposition 3. [10] The vertices (a 0, a 1,..., a n 1 ) and ((a 0 + 2) mod 4, a 1,..., a n 1 ) of BH n have the same neighborhood. 3. Main Results Firstl, we characterize edges of the BH n. Let u and v be two adjacent vertices in BH n. If u and v differ in onl the inner inde, then uv is said to be a 0-dimensional edge, and u is a 0-dimensional neighbor of v. If u and v differ in not onl the inner inde, but also some i-dimensional inde (i = 0) of the vertices, then uv is called an i-dimensional edge, and u is an i-dimensional neighbor of v. For convenience, we denote the set of all i-dimensional edges b D i (0 i n 1). Let BH (i) n 1 (0 i 3) be the subgraph of BH n induced b the vertices of BH n with the (n 1)-dimensional
4 Smmetr 2017, 9, 79 4 of 12 inde i. That is, the BH (i) n 1 s can be obtained from BH n b deleting all (n 1)-dimensional edges. Therefore, BH (i) n 1 = BH n 1 for each 0 i 3. B Proposition 1, we know that BH n is bipartite. We can use V 0 and V 1 to denote the two partite sets of BH n such that V 0 and V 1 consist of vertices of BH n with an even inner inde and an odd inner inde, respectivel. For convenience, the vertices of V 0 and V 1 are colored white and black, respectivel. Throughout this paper, we use w i and u i (resp. b i and v i ) to denote white (resp. black) vertices in BH (i) n 1 (i {0, 1, 2, 3}). Lemma 1. [16] In BH n, D i (0 i n 1) can be divided into 4 n 1 edge-disjoint 4-ccles for n 1. Lemma 2. [12] The balanced hpercube BH n is Hamiltonian laceable and edge-bipancclic for n 1. Lemma 3. [17] The balanced hpercube BH n is hper-hamiltonian laceable for n 1. Lemma 4. [30] Assume u and are two different vertices in V 0, and v and are two different vertices in V 1. Then, there eist two verte-disjoint paths P and Q such that P joins to, Q joins u to v and V(P) V(Q) = V(BH n ), where n 1. Lemma 5. Let n 2 be an integer. Suppose that u, v, and are four distinct vertices differ onl the inner inde in BH n. In addition, u, V 0 and v, V 1. Then, there eists a Hamiltonian path from u to v in BH n. Proof. We proceed with the proof b the induction on n. First, we consider n = 2. Clearl, u, v, and are in the same 4-ccle of D 0. A Hamiltonian path of BH 2 from u to v is shown in Figure 3. Thus, we suppose that the lemma holds for all integers n 1 with n 3. Net, we consider BH n. We split BH n into four BH n 1 s b deleting (n 1)-dimensional edges. For convenience, we denote the four BH n 1 s b B 0, B 1, and according to the last position of vertices in BH n, respectivel. Without loss of generalit, we ma assume that u, v, and are in B 0. B an induction hpothesis, there eists a Hamiltonian path P 0 from u to v in B 0. Let E(P 1 ), where (resp. ) are neither end-verte of P 0. We denote the segment of P 0 from u to b P 00, and the segment of P 0 from to v b P 10. B Definition 1, (resp. ) has an (n 1)-dimensional neighbor (resp. u 3 ) in B 1 (resp. ). Moreover, there eist an edge from to, and an edge from to B 1. Therefore, there eist a Hamiltonian path from u 3 to in, a Hamiltonian path P 2 from to in, and a Hamiltonian path P 1 from to of B 1. Hence, u, P 00,, u 3,,,, P 2,,, P 1,,, P 10, v is a Hamiltonian path of BH n (see Figure 4). u v Figure 3. A Hamiltonian path of BH 2.
5 Smmetr 2017, 9, 79 5 of 12 v u v P 1 P 10 1 P 00 u3 v3 P 2 Figure 4. A Hamiltonian path of BH n. Net, we present the following lemma as a basis of our main theorem. Lemma 6. Let e be an arbitrar edge in BH 2. In addition, let V 1 and V 0 be an two vertices in BH 2 with e =. Then, there eists a Hamiltonian path between and passing through e. Proof. B Proposition 2, BH 2 is verte-transitive and edge-transitive, and we ma suppose that e = (0, 0)(1, 0). Obviousl, if e =, then there eists no Hamiltonian path of BH 2 from to passing e. Thus, at most, one of and is the end-verte of e. We consider the following two cases: Case 1: Neither nor is incident to e. B the relative positions of and, and Proposition 3, we consider the following: (1) V(B 0 ), V(B 0 ); (2) V(B 0 ), V(B 1 ); (3) V(B 0 ), V( ); (4) V(B 0 ), V( ); (5) V(B 1 ), V(B 1 ); (6) V(B 1 ), V( ); (7) V(B 1 ), V( ); (8) V( ), V( ); (9) V( ), V( ); (10) V( ), V( ). For simplicit, we list all Hamiltonian paths of the conditions above in Table 1. Case 2: Either or is incident to e. Without loss of generalit, suppose that is incident to e, that is, = (1, 0). B Proposition 3, we need onl to consider four conditions of : (1) V(B 0 ); (2) V(B 1 ); (3) V( ); and (4) V( ). Again, we list Hamiltonian paths of the conditions of and in this case in Table 2. Table 1. Hamiltonian paths passing through e with neither nor being incident to e. Hamiltonian Paths Passing through e with Neither nor Being Incident to e (1) (3,0) (2,0) (3,0)(0,3)(3,3)(2,3)(1,3)(0,2)(3,2)(2,2)(1,2)(2,1)(3,1)(0,1)(1,1)(0,0)(1,0)(2,0) (2) (3,0) (0,1) (3,0)(0,0)(1,0)(2,3)(3,3)(0,3)(1,3)(0,2)(3,2)(2,2)(1,2)(2,1)(3,1)(2,0)(1,1)(0,1) (3) (3,0) (2,2) (3,0)(0,3)(3,3)(2,3)(1,0)(0,0)(3,1)(2,0)(1,1)(0,1)(1,2)(2,1)(3,2)(0,2)(1,3)(2,2) (4) (3,0) (0,3) (3,0)(0,0)(1,0)(2,0)(3,1)(0,1)(1,1)(2,1)(1,2)(2,2)(3,2)(0,2)(1,3)(2,3)(3,3)(0,3) (5) (1,1) (2,1) (1,1)(0,1)(3,1)(2,0)(1,0)(0,0)(3,0)(0,3)(3,3)(2,3)(1,3)(0,2)(3,2)(2,2)(1,2)(2,1) (6) (1,1) (2,2) (1,1)(0,1)(3,1)(2,0)(1,0)(0,0)(3,0)(0,3)(3,3)(2,3)(1,3)(0,2)(3,2)(2,1)(1,2)(2,2) (7) (1,1) (2,3) (1,1)(0,0)(3,1)(0,1)(1,2)(2,1)(3,2)(2,2)(1,3)(0,2)(3,3)(0,3)(1,0)(2,0)(3,0)(2,3) (8) (1,2) (2,2) (1,2)(2,1)(1,1)(0,1)(3,1)(2,0)(1,0)(0,0)(3,0)(0,3)(3,3)(2,3)(1,3)(0,2)(3,2)(2,2) (9) (1,2) (2,3) (1,2)(2,1)(1,1)(0,1)(3,1)(2,0)(1,0)(0,0)(3,0)(0,3)(1,3)(2,2)(3,2)(0,2)(3,3)(2,3) (10) (1,3) (2,3) (1,3)(0,3)(3,0)(0,0)(1,0)(2,0)(1,1)(2,1)(3,1)(0,1)(3,2)(2,2)(1,2)(0,2)(3,3)(2,3)
6 Smmetr 2017, 9, 79 6 of 12 Table 2. Hamiltonian paths passing through e with or being incident to e. Hamiltonian Paths Passing through e with or Being Incident to e (1) (1,0) (2,0) (1,0)(0,0)(3,0)(0,3)(3,3)(2,3)(1,3)(0,2)(3,2)(2,2)(1,2)(2,1)(1,1)(0,1)(3,1)(2,0) (2) (1,0) (0,1) (1,0)(0,0)(3,0)(0,3)(3,3)(2,3)(1,3)(0,2)(3,2)(2,2)(1,2)(2,1)(1,1)(2,0)(3,1)(0,1) (3) (1,0) (0,2) (1,0)(0,0)(3,0)(0,3)(1,3)(2,3)(3,3)(2,2)(3,2)(2,1)(1,1)(2,0)(3,1)(0,1)(1,2)(0,2) (4) (1,0) (0,3) (1,0)(0,0)(3,0)(2,0)(3,1)(0,1)(1,1)(2,1)(1,2)(2,2)(3,2)(0,2)(1,3)(2,3)(3,3)(0,3) Now, we are read to state the main theorem of this paper. Theorem 1. Let n 2 be an integer and e be an arbitrar edge in BH n. In addition, let V 1 and V 0 be an two vertices in BH n with e =. Then, there eists a Hamiltonian path of BH n between and passing through e. Proof. We prove this theorem b induction on n. B Lemma 6, we know that the theorem is true for n = 2. Therefore, we suppose that the theorem holds for n 1 with n 3. Net, we consider BH n. Firstl, we divide BH n into BH (i) n 1 (0 i 3) b deleting all (n 1)-dimensional edges. For convenience, we denote BH (i) n 1 b B i according to the last position of the vertices in BH n for each i {0, 1, 2, 3}. Similarl, suppose that e E(B 0 ). Let V 1 and V 0 be two distinct vertices in BH n. B relative positions of and, we consider the following cases: Case 1: V(B 0 ), V(B 0 ). B an induction hpothesis, there eists a Hamiltonian path P 0 from to of B 0 passing through e. Thus, there is an edge on P 0 such that is not adjacent to e and divides P 0 into two sections P 00 and P 10, where P 00 connects to and P 10 connects to. Let (resp. u 3 ) be an (n 1)-dimensional neighbor of (resp. ). B Definition 1, there eist an edge from B 1 to, and an edge from to. Thus, b Lemma 2, there eist a Hamiltonian path P 1 from to in B 1, a Hamiltonian path P 2 from to in, and a Hamiltonian path from to u 3 in. Hence,, P 00,,, P 1,,, P 2,,,, u 3,, P 10, is a Hamiltonian path of BH n from to passing through e (see Figure 5). P 00 P 10 P 1 u3 v3 P 2 Figure 5. Illustration for Case 1. Case 2: V(B 0 ), V(B 1 ). Let V(B 0 ) be a white verte such that is not incident to e. B an induction hpothesis, there eists a Hamiltonian path P 0 of B 0 from to passing through e. Supposing that is a black verte adjacent to on P 0, we denote the segment of the path P 0 from to b P 00. Let the two (n 1)-dimensional neighbors of be b 1 and. B Lemma 2, there eists a Hamiltonian path P 1 of B 1 from b 1 to. Let be the neighbor of in the section of P 1 from b 1 to. Then P 1 consists of two subpaths P 01 and P 11, which connect to b 1 and to, respectivel.
7 Smmetr 2017, 9, 79 7 of 12 Let u 3 (resp. ) be an (n 1)-dimensional neighbor of (resp. ). Furthermore, there eists an edge from to. Then, there eist a Hamiltonian path P 2 from to in, and a Hamiltonian path from u 3 to in. Hence,, P 00,, u 3,,,, P 2,,, P 01, b 1,,, P 11, is a Hamiltonian path of BH n from to passing through e (see Figure 6). P 00 b1 P 01 P 11 u3 v3 P 2 Figure 6. Illustration for Case 2. Case 3: V(B 0 ), V( ). Let be a white verte in B 0 not incident to e, and b 1 and be two (n 1)-dimensional neighbors of. In addition, assume that w 1 is an arbitrar white verte in B 1. There eists a Hamiltonian path of B 1 from b 1 to w 1. Thus, there eists an edge E(P 1 ) whose removal will lead to two disjoint subpaths P 01 and P 11, where P 01 connects to b 1 and P 11 connects to w 1. Let (resp. b 2 ) be an (n 1)-dimensional neighbor of (resp. w 1 ). There also eists a Hamiltonian path P 2 of from to b 2 via the edge. Deleting results in two disjoint paths P 02 and P 12, where P 02 connects to b 2 and P 12 connects to. B an induction hpothesis, there eists a Hamiltonian path P 0 of B 0 from to via the edge. For convenience, denote P 0 b P 00, that is, P 00 connects to. Let u 3 (resp. ) be an (n 1)-dimensional neighbor of (resp. ). Again, there eists a Hamiltonian path of from u 3 to. Hence,, P 00,, u 3,,,, P 02, b 2, w 1, P 11,,, b 1, P 01,,, P 12, is a Hamiltonian path of BH n from to passing through e (see Figure 7). u 3 P 00 b1 P 01 P 12 P 02 P 11 w 1 b 2 Figure 7. Illustration for Case 3. Case 4: V(B 0 ), V( ). Let (resp. ) be a white (resp. black) verte in B 0 (resp. ). There eist an edge from B 0 to B 1, an edge from B 1 to, and an edge from to.
8 Smmetr 2017, 9, 79 8 of 12 B Lemma 2, there eist a Hamiltonian path P 1 of B 1 from to, a Hamiltonian path P 2 of from to, and a Hamiltonian path of from to u 3. B an induction hpothesis, there eists a Hamiltonian path P 0 of B 0 from to passing through e. Hence,, P 0,,, P 1,,, P 2,,,, is a Hamiltonian path of BH n from to passing through e (see Figure 8). P 0 u v 0 1 P1 P 2 Figure 8. Illustration for Case 4. Case 5: V(B 1 ), V(B 1 ). Let = be a black verte in B 1. B Lemma 3, there eists a Hamiltonian path P 1 of B 1 from to. Furthermore, there eist an edge from B 1 to B 0, an edge u 3 from B 0 to, an edge from to, and an edge from to B 1. Moreover, there eist a Hamiltonian path P 0 of B 0 from to passing through e, a Hamiltonian path of from u 3 to, and a Hamiltonian path P 2 of from to. Hence,, P 1,,, P 0,, u 3,,,, P 2,, is a Hamiltonian path of BH n from to passing through e (see Figure 9). P 0 P 1 v2 u3 P P 2 3 Figure 9. Illustration for Case 5. Case 6: V(B 1 ), V( ). Let = (resp. ) be a black (resp. white) verte in B 1. B Lemma 3, there eists a Hamiltonian path P 1 of B 1 from to. In addition, suppose that and b 2 are two (n 1)-dimensional neighbors of. B Lemma 2, there eists a Hamiltonian P 2 of from to via the edge b 2. Thus, P 2 can be divided into three sections: P 02, and P 12, where P 02 connects to and P 12 connects b 2 to. Furthermore, there eist an edge from B 1 to B 0, an edge u 3 from B 0 to, and an edge from to. Therefore, there eist a Hamiltonian path P 0 of B 0 from to passing through e, and a Hamiltonian path of from u 3 to. Hence,, P 1,,, P 0,, u 3,,,, P 02,,, b 2, P 12, is a Hamiltonian path of BH n from to passing through e (see Figure 10).
9 Smmetr 2017, 9, 79 9 of 12 P 0 P u0 1 P 02 b 2 u 3 P 12 Figure 10. Illustration for Case 6. Case 7: V(B 1 ), V( ). Let and b 3 be two black vertices in. Suppose that and w 2 are (n 1)-dimensional neighbors of and b 2, respectivel. B Lemma 3, there eists a Hamiltonian path of from b 3 to. B Definition 1, there eist two edges and b 2 w 1 from to B 1, an edge from B 1 to B 0, and an edge from B 0 to, where =. B Lemma 4, there eist two verte-disjoint paths P 01 and P 11 such that P 01 joins and, P 11 joins and w 1, and V(P 01 ) V(P 11 ) = V(B 1 ). Similarl, there eist two verte-disjoint paths P 02 and P 12 such that P 02 joins and, P 12 joins b 2 and w 2, and V(P 02 ) V(P 12 ) = V( ). B an induction hpothesis, there eists a Hamiltonian path P 0 of B 0 from to passing through e. Hence,, P 11, w 1, b 2, P 12, w 2, b 3,,,, P 02,,, P 01,,, P 0,, is a Hamiltonian path of BH n from to passing through e (see Figure 11). v P 11 0 P 0 P 01 w 1 P 02 b 2 b 3 w 2 P 12 Figure 11. Illustration for Case 7. Case 8: V( ), V( ). Let V( ) be an arbitrar white verte. B Lemma 3, there eists a Hamiltonian path P 2 of from to. B Definition 1, there eist an edge from to B 1, an edge from B 1 to B 0, an edge u 3 from B 0 to, and an edge from to. Following Lemma 2, we can obtain a Hamiltonian path P 1 of B 1 from to, and a Hamiltonian path of from u 3 to. B an induction hpothesis, there eists a Hamiltonian path P 0 of B 0 from to passing through e. Therefore,,, P 1,,, P 0,, u 3,,,, P 2, is a Hamiltonian path of BH n from to passing through e (see Figure 12).
10 Smmetr 2017, 9, of 12 P 0 P 1 u 3 P 2 Figure 12. Illustration for Case 8. Case 9: V( ), V( ). Let and w 2 be two distinct white vertices in, and and b 3 be (n 1)-dimensional neighbors of and w 2, respectivel. B Lemma 3, there eists a Hamiltonian path P 2 of from to w 2. B Lemma 2, there eists a Hamiltonian path of from to via the edge u 3 b 3. B deleting u 3 b 3, we can obtain two disjoint subpaths: P 03 and P 13, where P 03 connects u 3 to and P 13 connects b 3 to. Furthermore, there eist an edge from to B 1, an edge from B 1 to B 0, and an edge u 3 from B 0 to. B Lemma 2, there eists a Hamiltonian path P 1 of B 1 from to. B an induction hpothesis, there eists a Hamiltonian path P 0 of B 0 from to passing through e. Hence,,, P 1,,, P 0,, u 3, P 03,,, P 2, w 2, b 3, P 13, is a Hamiltonian path of BH n from to passing through e (see Figure 13). P 0 P 1 u P 03 3 P 13 w b3 3 P 2 Figure 13. Illustration for Case 9. Case 10: V( ), V( ). The proof is analogous to that of Case 5, and we omit it. 4. Conclusions In this paper, we stud a tpe of path embedding of the balanced hpercube, and show that, for an arbitrar edge e =, there eists a Hamiltonian path between an two vertices and in different partite sets passing through e. This result also implies that each edge is on a Hamiltonian ccle of the balanced hpercube, which is part of the results of edge bipancclicit of the balanced hpercube. Acknowledgments: This work was supported b National Natural Science Foundation of China under Grant Nos and , Program for New Centur Ecellent Talents in Universit under Grant No. NCET ,
11 Smmetr 2017, 9, of 12 Major Project of High Resolution Earth Observation Sstem with Grant No. 30-Y20A /17, Strategic Priorit Research Program of the Chinese Academ of Sciences with Grant No. XDA , Gansu Sci.&Tech. Program under Grant Nos. 1104GKCA049, 1204GKCA061 and 1304GKCA018, The Fundamental Research Funds for the Central Universities under Grant No. lzujbk , Gansu Telecom Cuiing Research Fund under Grant No. lzudc , Google Research Awards and Google Facult Award, China. Author Contributions: Dan Chen and Chong Chen initiated the research idea and developed the models with contributions from Gaofeng Zhang. Zhongzhou Lu and Zebang Shen offered help while constructing the model. The manuscript was written b Dan Chen and Chong Chen with Rui Zhou and Qingguo Zhou providing review and comments. All the authors were engaged in the final manuscript preparation and agreed to the publication of this paper. Conflicts of Interest: The authors declare no conflict of interest. References 1. Abraham, S.; Padmanabhan, K. The twisted cube topolog for multiprocessors: A stud in network asmmetr. J. Parall. Distrib. Comput. 1991, 13, , doi: / (91)90113-n. 2. Choudum, S.A.; Sunitha, V. Augmented cubes. Networks 2002, 40, Cull, P.; Larson, S.M. The Möbius cubes. IEEE Trans. Comput. 1995, 44, Dall, W.J. Performance analsis of k-ar n-cube interconnection networks. IEEE Trans. Comput. 1990, 39, Efe, K. The crossed cube architecture for parallel computation. IEEE Trans. Parall. Distr. Sst. 1992, 3, El-amaw, A.; Latifi, S. Properties and performance of folded hpercubes. IEEE Trans. Parall. Distrib. Sst. 1991, 2, Li, T.K.; Tan, J.J.M.; Hsu, L.H.; Sung, T.Y. The shuffle-cubes and their generalization. Inform. Process. Lett. 2001, 77, Preparata, F.P.; Vuillemin, J. The cube-connected ccles: A versatile network for parallel computation. Comput. Arch. Sst. 1981, 24, Xiang, Y.; Stewart, I.A. Augmented k-ar n-cubes. Inform. Sci. 2011, 181, Wu, J.; Huang, K. The balanced hpercube: A cube-based sstem for fault-tolerant applications. IEEE Trans. Comput. 1997, 46, Huang, K.; Wu, J. Fault-tolerant resource placement in balanced hpercubes. Inform. Sci. 1997, 99, Xu, M.; Hu, H.; Xu, J. Edge-pancclicit and Hamiltonian laceabilit of the balanced hpercubes. Appl. Math. Comput. 2007, 189, Yang, M. Bipanconnectivit of balanced hpercubes. Comput. Math. Appl. 2010, 60, Huang, K.; Wu, J. Area efficient laout of balanced hpercubes. Int. J. High Speed Electr. Sst. 1995, 6, Yang, M. Super connectivit of balanced hpercubes. Appl. Math. Comput. 2012, 219, Lü, H.; Li, X.; Zhang, H. Matching preclusion for balanced hpercubes. Theor. Comput. Sci. 2012, 465, 10 20, doi: /j.tcs Lü, H.; Zhang, H. Hper-Hamiltonian laceabilit of balanced hpercubes. J. Supercomput. 2014, 68, , doi: /s Lü, H.; Gao, X.; Yang, X. Matching etendabilit of balanced hpercubes. Ars Combinatoria 2016, 129, Lü, H. On etra connectivit and etra edge-connectivit of balanced hpercubes. Int. J. Comput. Math. 2017, 94, Zhou, J.-X.; Wu, Z.-L.; Yang, S.-C.; Yuan, K.-W. Smmetric propert and reliabilit of balanced hpercube. IEEE Trans. Comput. 2015, 64, Zhou, J.-X.; Kwak, J.; Feng, Y.-Q.; Wu, Z.-L. Automorphism group of the balanced hpercube. Ars Math. Contemp. 2017, 12, Jha, P.K.; Prasad, R. Hamiltonian decomposition of the rectangular twisted torus. IEEE Trans. Comput. 2012, 23, Chang, N.-W.; Tsai, C.-Y.; Hsieh, S.-Y. On 3-etra connectivit and 3-etra edge connectivit of folded hpercubes. IEEE Trans. Comput. 2014, 63, Hsieh, S.-Y.; Yu, P.-Y. Fault-free mutuall independent Hamiltonian ccles in hpercubes with fault edges. J. Combin. Optim. 2007, 13,
12 Smmetr 2017, 9, of Park, C.; Chwa, K. Hamiltonian properties on the class of hpercube-like networks. Inform. Process. Lett. 2004, 91, Wang, S.; Li, J.; Wang, R. Hamiltonian paths and ccles with prescribed edges in the 3-ar n-cube. Inform. Sci. 2011, 181, Simmons, G. Almost all n-dimensional rectangular lattices are Hamilton Laceable. Congr. Numer. 1978, 21, West, D.B. Introduction to Graph Theor, 2nd ed.; Prentice Hall: Englewood Cliffs, NJ, USA, Xu, J.M. Topological Structure and Analsis of Interconnection Networks; Kluwer Academic Publishers: Dordrecht, The Netherlands, Cheng, D.; Hao, R.-X.; Feng, Y.-Q. Two node-disjoint paths in balanced hpercubes. Appl. Math. Comput. 2014, 242, c 2017 b the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (
ON THE EDGE-HYPER-HAMILTONIAN LACEABILITY OF BALANCED HYPERCUBES
Discussiones Mathematicae Graph Theory 36 (2016) 805 817 doi:10.7151/dmgt.1908 ON THE EDGE-HYPER-HAMILTONIAN LACEABILITY OF BALANCED HYPERCUBES Jianxiang Cao, Minyong Shi School of Computer Science Communication
More informationarxiv: v1 [math.co] 27 Apr 2016
arxiv:1604.07895v1 [math.co] 27 Apr 2016 Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges Mei-Mei Gu Department of Mathematics, Beijing Jiaotong University, Beijing 100044,
More informationAlgebraic Properties and Panconnectivity of Folded Hypercubes
Algebraic Properties and Panconnectivity of Folded Hypercubes Meijie Ma a Jun-Ming Xu b a School of Mathematics and System Science, Shandong University Jinan, 50100, China b Department of Mathematics,
More informationBipanconnectivity of Cartesian product networks
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 46 (2010), Pages 297 306 Bipanconnectivity of Cartesian product networks You Lu Jun-Ming Xu Department of Mathematics University of Science and Technology of
More informationEdge-pancyclicity of Möbius cubes
Information Processing Letters 96 (25) 136 14 www.elsevier.com/locate/ipl Edge-pancyclicity of Möbius cubes Min Xu a,b, Jun-Ming Xu b, a Institute of Applied Mathematics, Academy of Mathematics and Systems
More informationHybrid Fault diagnosis capability analysis of Hypercubes under the PMC model and MM model
Hybrid Fault diagnosis capability analysis of Hypercubes under the PMC model and MM model Qiang Zhu,Lili Li, Sanyang Liu, Xing Zhang arxiv:1709.05588v1 [cs.dc] 17 Sep 017 Abstract System level diagnosis
More informationHamiltonicity and Fault Tolerance
Hamiltonicit and Fault Tolerance in the k-ar n-cube B Clifford R. Haithcock Portland State Universit Department of Mathematics and Statistics 006 In partial fulfillment of the requirements of the degree
More informationConstant 2-labelling of a graph
Constant 2-labelling of a graph S. Gravier, and E. Vandomme June 18, 2012 Abstract We introduce the concept of constant 2-labelling of a graph and show how it can be used to obtain periodic sphere packing.
More informationHyper-Panconnectedness of the Locally Twisted Cube
Hyper-Panconnectedness of the Locally Twisted Cube Tzu-Liang Kung Department of Computer Science and Information Engineering Asia University, Wufeng, Taichung tlkung@asia.edu.tw Lih-Hsing Hsu and Jia-Jhe
More informationarxiv: v1 [math.co] 21 Dec 2016
The integrall representable trees of norm 3 Jack H. Koolen, Masood Ur Rehman, Qianqian Yang Februar 6, 08 Abstract In this paper, we determine the integrall representable trees of norm 3. arxiv:6.0697v
More informationAutomorphism group of the balanced hypercube
Abstract Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 12 (2017) 145 154 Automorphism group of the balanced hypercube
More informationPARALLEL computing is important for speeding up
Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Partition in Augmented Cubes Ruo-Wei Hung and Chien-Chih Liao Abstract The n-dimensional hypercube networ Q n is one of the most popular interconnection
More informationPARALLEL computing is important for speeding up. Embedding Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles into Twisted Cubes
Embedding Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles into Twisted Cubes Ruo-Wei Hung, Shang-Ju Chan, and Chien-Chih Liao Abstract The presence of edge-disjoint Hamiltonian
More informationTheoretical Computer Science. Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science 410 (2009) 766 775 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Fault-free longest paths in star networks
More informationFlows and Connectivity
Chapter 4 Flows and Connectivit 4. Network Flows Capacit Networks A network N is a connected weighted loopless graph (G,w) with two specified vertices and, called the source and the sink, respectivel,
More informationMutually Independent Hamiltonian Paths in Star Networks
Mutually Independent Hamiltonian Paths in Star Networks Cheng-Kuan Lin a, Hua-Min Huang a, Lih-Hsing Hsu b,, and Sheng Bau c, a Department of Mathematics National Central University, Chung-Li, Taiwan b
More informationOrientations of digraphs almost preserving diameter
Orientations of digraphs almost preserving diameter Gregor Gutin Department of Computer Science Roal Hollowa, Universit of London Egham, Surre TW20 0EX, UK, gutin@dcs.rhbnc.ac.uk Anders Yeo BRICS, Department
More informationConstructing Independent Spanning Trees on Locally Twisted Cubes in Parallel
Constructing Independent Spanning Trees on Locally Twisted Cubes in Parallel Yu-Huei Chang Jinn-Shyong Yang, Jou-Ming Chang Department of Information Management, National Taipei College of Business, Taipei,
More informationARTICLE IN PRESS Theoretical Computer Science ( )
Theoretical Computer Science ( ) Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Conditional matching preclusion for hypercube-like
More informationThe thickness of K 1,n,n and K 2,n,n
Abstract ISSN 1855-3966 (printed edn.), ISSN 1855-397 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 15 (2018) 355 373 https://doi.org/10.2693/1855-397.1223.b26 (Also available at http://amc-journal.eu)
More informationMAXIMAL VERTEX-CONNECTIVITY OF S n,k
MAXIMAL VERTEX-CONNECTIVITY OF S n,k EDDIE CHENG, WILLIAM A. LINDSEY, AND DANIEL E. STEFFY Abstract. The class of star graphs is a popular topology for interconnection networks. However it has certain
More informationFuzzy Topology On Fuzzy Sets: Regularity and Separation Axioms
wwwaasrcorg/aasrj American Academic & Scholarl Research Journal Vol 4, No 2, March 212 Fuzz Topolog n Fuzz Sets: Regularit and Separation Aioms AKandil 1, S Saleh 2 and MM Yakout 3 1 Mathematics Department,
More informationARTICLE IN PRESS Discrete Applied Mathematics ( )
Discrete Applied Mathematics ( ) Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Forwarding index of cube-connected cycles Jun Yan a,
More informationINTEGER-MAGIC SPECTRA OF AMALGAMATIONS OF STARS AND CYCLES. Sin-Min Lee San Jose State University San Jose, CA
INTEGER-MAGIC SPECTRA OF AMALGAMATIONS OF STARS AND CYCLES Sin-Min Lee San Jose State Universit San Jose, CA 9592 lee@cs.sjsu.edu Ebrahim Salehi Department of Mathematical Sciences Universit of Nevada
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationThe Restricted Edge-Connectivity of Kautz Undirected Graphs
The Restricted Edge-Connectivity of Kautz Undirected Graphs Ying-Mei Fan College of Mathematics and Information Science Guangxi University, Nanning, Guangxi, 530004, China Jun-Ming Xu Min Lü Department
More informationImproving the Height of Independent Spanning Trees on Folded Hyper-Stars
Improving the Height of Independent Spanning Trees on Folded Hyper-Stars Sih-Syuan Luo 1 Jinn-Shyong Yang 2 Jou-Ming Chang 1, An-Hang Chen 1 1 Institute of Information and Decision Sciences, National Taipei
More informationPancycles and Hamiltonian-Connectedness of the Hierarchical Cubic Network
Pancycles and Hamiltonian-Connectedness of the Hierarchical Cubic Network Jung-Sheng Fu Takming College, Taipei, TAIWAN jsfu@mail.takming.edu.tw Gen-Huey Chen Department of Computer Science and Information
More informationDetermining The Pattern for 1- fault Tolerant Hamiltonian Cycle From Generalized Petersen Graph P(n,k)
26 Determining The Pattern for 1- fault Tolerant Hamiltonian Cycle From Generalized Petersen Graph P(n,k) Wamiliana, F. A. M. Elfaki, Ahmad Faisol, Mustofa Usman, Isna Evi Lestari Department of Mathematics,
More informationA PARTIAL CHARACTERIZATION OF THE COCIRCUITS OF A SPLITTING MATROID
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT A PARTIAL CHARACTERIZATION OF THE COCIRCUITS OF A SPLITTING MATROID DR. ALLAN D. MILLS MAY 2004 No. 2004-2 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookeville, TN 38505
More informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics http://jipam.vu.edu.au/ Volume 2, Issue 2, Article 15, 21 ON SOME FUNDAMENTAL INTEGRAL INEQUALITIES AND THEIR DISCRETE ANALOGUES B.G. PACHPATTE DEPARTMENT
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationOn Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci Cubes
American Journal of Applied Sciences 5(11): 1605-1610, 2008 ISSN 1546-9239 2008 Science Publications On Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci Cubes 1 Ioana Zelina, 2 Grigor Moldovan
More informationResearch on the Framework of Edge Coloring Hypergraph Color Hamiltonian Cycle and H-factor Based on Combinatorial Mathematics of Graph Theory
Research on the Framework of Edge Coloring Hypergraph Color Hamiltonian Cycle and H-factor Based on Combinatorial Mathematics of Graph Theory Abstract Yongwang Jia, Lianhua Bai, Lianwang Chen Inner Mongolia
More informationGraph Theory and Interconnection Networks
Graph Theory and Interconnection Networks Lih-Hsing Hsu and Cheng-Kuan Lin @ CRC Press Taylor & Francis Group Boca Raton London New York CRC Press is an imprint of the Taylor & Francis Group, an informa
More informationThe super connectivity of shuffle-cubes
Information Processing Letters 96 (2005) 123 127 www.elsevier.com/locate/ipl The super connectivity of shuffle-cubes Jun-Ming Xu a,,minxu b, Qiang Zhu c a Department of Mathematics, University of Science
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More information2015 AASRI International Conference on Industrial Electronics and Applications (IEA 2015) Study on Optimization for Grey Forecasting Model.
05 AASRI International Conference on Industrial Electronics and Applications (IEA 05 Stud on Optimiation for Gre Forecasting Model Ying Li Min-an Tang Tao Liu Min-an Tang School of Automation and Electrical
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 informationTime-Frequency Analysis: Fourier Transforms and Wavelets
Chapter 4 Time-Frequenc Analsis: Fourier Transforms and Wavelets 4. Basics of Fourier Series 4.. Introduction Joseph Fourier (768-83) who gave his name to Fourier series, was not the first to use Fourier
More informationAn analytic proof of the theorems of Pappus and Desargues
Note di Matematica 22, n. 1, 2003, 99 106. An analtic proof of the theorems of Pappus and Desargues Erwin Kleinfeld and Tuong Ton-That Department of Mathematics, The Universit of Iowa, Iowa Cit, IA 52242,
More informationHamiltonian chromatic number of block graphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 21, no. 3, pp. 353 369 (2017) DOI: 10.7155/jgaa.00420 Hamiltonian chromatic number of block graphs Devsi Bantva 1 1 Lukhdhirji Engineering
More information8. BOOLEAN ALGEBRAS x x
8. BOOLEAN ALGEBRAS 8.1. Definition of a Boolean Algebra There are man sstems of interest to computing scientists that have a common underling structure. It makes sense to describe such a mathematical
More informationThe approximation of piecewise linear membership functions and Łukasiewicz operators
Fuzz Sets and Sstems 54 25 275 286 www.elsevier.com/locate/fss The approimation of piecewise linear membership functions and Łukasiewicz operators József Dombi, Zsolt Gera Universit of Szeged, Institute
More informationThe g-extra Conditional Diagnosability of Folded Hypercubes
Applied Mathematical Sciences, Vol. 9, 2015, no. 146, 7247-7254 HIKARI Ltd, www.m-hikari.com http://dx.doi.or/10.12988/ams.2015.510679 The -Extra Conditional Dianosability of Folded Hypercubes Weipin Han
More informationAssociativity of triangular norms in light of web geometry
Associativit of triangular norms in light of web geometr Milan Petrík 1,2 Peter Sarkoci 3 1. Institute of Computer Science, Academ of Sciences of the Czech Republic, Prague, Czech Republic 2. Center for
More informationApplied Mathematics Letters
Applied Mathematics Letters (009) 15 130 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Spectral characterizations of sandglass graphs
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
More informationUNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS
UNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS MARIA CHUDNOVSKY, RINGI KIM, SANG-IL OUM, AND PAUL SEYMOUR Abstract. An n-vertex graph is prime if it has no homogeneous set, that
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 informationarxiv: v1 [math.co] 1 Jan 2013
Ricci-flat graphs with girth at least five arxiv:1301.0102v1 [math.co] 1 Jan 2013 Yong Lin Renmin Universit of China S.-T. Yau Harvard Universit Januar 3, 2013 Abstract Linuan Lu Universit of South Carolina
More informationIBM Research Report. On the Linear Relaxation of the p-median Problem I: Oriented Graphs
RC4396 (W07-007) November, 007 Mathematics IBM Research Report On the Linear Relaxation of the p-median Problem I: Oriented Graphs Mourad Baïou CNRS LIMOS Complexe scientifique des Czeaux 6377 Aubiere
More informationPaths and cycles in extended and decomposable digraphs
Paths and cycles in extended and decomposable digraphs Jørgen Bang-Jensen Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract We consider digraphs called extended
More informationDesign and Analysis of Algorithms
CSE 0, Winter 208 Design and Analsis of Algorithms Lecture 6: NP-Completeness, Part 2 Class URL: http://vlsicad.ucsd.edu/courses/cse0-w8/ The Classes P and NP Classes of Decision Problems P: Problems for
More informationConquering Edge Faults in a Butterfly with Automorphisms
International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS-0) Conquering Edge Faults in a Butterfly with Automorphisms Meghanad D. Wagh and Khadidja Bendjilali Department
More informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationGray Codes for Torus and Edge Disjoint Hamiltonian Cycles Λ
Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles Λ Myung M. Bae Scalable POWERparallel Systems, MS/P963, IBM Corp. Poughkeepsie, NY 6 myungbae@us.ibm.com Bella Bose Dept. of Computer Science Oregon
More informationDomination and Total Domination Contraction Numbers of Graphs
Domination and Total Domination Contraction Numbers of Graphs Jia Huang Jun-Ming Xu Department of Mathematics University of Science and Technology of China Hefei, Anhui, 230026, China Abstract In this
More informationResearch Article Chaotic Attractor Generation via a Simple Linear Time-Varying System
Discrete Dnamics in Nature and Societ Volume, Article ID 836, 8 pages doi:.//836 Research Article Chaotic Attractor Generation via a Simple Linear Time-Varing Sstem Baiu Ou and Desheng Liu Department of
More informationAn Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs
Journal of Information Processing Systems, Vol.7, No.1, March 2011 DOI : 10.3745/JIPS.2011.7.1.075 An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs Jung-Hwan Chang*
More informationVertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 17:3, 2015, 1 12 Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Hongliang Lu School of Mathematics and Statistics,
More informationChoice Numbers of Multi-Bridge Graphs
Computer Science Journal of Moldova, vol.25, no.3(75), 2017 Julian Allagan Benkam Bobga Abstract Suppose ch(g) and χ(g) denote, respectively, the choice number and the chromatic number of a graph G = (V,E).
More informationLESSON #42 - INVERSES OF FUNCTIONS AND FUNCTION NOTATION PART 2 COMMON CORE ALGEBRA II
LESSON #4 - INVERSES OF FUNCTIONS AND FUNCTION NOTATION PART COMMON CORE ALGEBRA II You will recall from unit 1 that in order to find the inverse of a function, ou must switch and and solve for. Also,
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationSet-orderedness as a generalization of k-orderedness and cyclability
Set-orderedness as a generalization of k-orderedness and cyclability Keishi Ishii Kenta Ozeki National Institute of Informatics, Tokyo 101-8430, Japan e-mail: ozeki@nii.ac.jp Kiyoshi Yoshimoto Department
More informationA Characterization of Partial Directed Line Graphs
A Characterization of Partial Directed Line Graphs Nicola Apollonio Paolo G. Franciosa Abstract Can a directed graph be completed to a directed line graph? If possible, how many arcs must be added? In
More informationProjective synchronization of a complex network with different fractional order chaos nodes
Projective synchronization of a complex network with different fractional order chaos nodes Wang Ming-Jun( ) a)b), Wang Xing-Yuan( ) a), and Niu Yu-Jun( ) a) a) School of Electronic and Information Engineering,
More informationAll Good (Bad) Words Consisting of 5 Blocks
Acta Mathematica Sinica, English Series Jun, 2017, Vol 33, No 6, pp 851 860 Published online: January 25, 2017 DOI: 101007/s10114-017-6134-2 Http://wwwActaMathcom Acta Mathematica Sinica, English Series
More informationEmbed Longest Rings onto Star Graphs with Vertex Faults
Embed Longest Rings onto Star Graphs with Vertex Faults Sun-Yuan Hsieh, Gen-Huey Chen Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, ROC and Chin-Wen
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationExtremal Kirchhoff index of a class of unicyclic graph
South Asian Journal of Mathematics 01, Vol ( 5): 07 1 wwwsajm-onlinecom ISSN 51-15 RESEARCH ARTICLE Extremal Kirchhoff index of a class of unicyclic graph Shubo Chen 1, Fangli Xia 1, Xia Cai, Jianguang
More informationCatalan States of Lattice Crossing: Application of Plucking Polynomial
Catalan States of Lattice Crossing: Application of Plucking Polnomial Mieczslaw K. Dabkowski Jozef H. Prztcki arxiv:7.0528v [math.gt] 4 Nov 207 Abstract For a Catalan state C of a lattice crossing L (m
More informationMULTI-SCROLL CHAOTIC AND HYPERCHAOTIC ATTRACTORS GENERATED FROM CHEN SYSTEM
International Journal of Bifurcation and Chaos, Vol. 22, No. 2 (212) 133 ( pages) c World Scientific Publishing Compan DOI: 1.1142/S21812741332 MULTI-SCROLL CHAOTIC AND HYPERCHAOTIC ATTRACTORS GENERATED
More informationThe path of order 5 is called the W-graph. Let (X, Y ) be a bipartition of the W-graph with X = 3. Vertices in X are called big vertices, and vertices
The Modular Chromatic Number of Trees Jia-Lin Wang, Jie-Ying Yuan Abstract:The concept of modular coloring and modular chromatic number was proposed by F. Okamoto, E. Salehi and P. Zhang in 2010. They
More informationA Low-Complexity Approach to Computation of the Discrete Fractional Fourier Transform
Circuits Sst Signal Process (1) 36:411 4144 DOI 11/s34-1-53-z A Low-Compleit Approach to Computation of the Discrete Fractional Fourier Transform Dorota Majorkowska-Mech 1 Aleksandr Cariow 1 Received:
More informationL(3, 2, 1)-LABELING FOR CYLINDRICAL GRID: THE CARTESIAN PRODUCT OF A PATH AND A CYCLE. Byeong Moon Kim, Woonjae Hwang, and Byung Chul Song
Korean J. Math. 25 (2017), No. 2, pp. 279 301 https://doi.org/10.11568/kjm.2017.25.2.279 L(3, 2, 1)-LABELING FOR CYLINDRICAL GRID: THE CARTESIAN PRODUCT OF A PATH AND A CYCLE Byeong Moon Kim, Woonjae Hwang,
More informationSpanning Paths in Infinite Planar Graphs
Spanning Paths in Infinite Planar Graphs Nathaniel Dean AT&T, ROOM 2C-415 600 MOUNTAIN AVENUE MURRAY HILL, NEW JERSEY 07974-0636, USA Robin Thomas* Xingxing Yu SCHOOL OF MATHEMATICS GEORGIA INSTITUTE OF
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 informationIntroduction to Differential Equations. National Chiao Tung University Chun-Jen Tsai 9/14/2011
Introduction to Differential Equations National Chiao Tung Universit Chun-Jen Tsai 9/14/011 Differential Equations Definition: An equation containing the derivatives of one or more dependent variables,
More informationMANY physical structures can conveniently be modelled
Proceedings of the World Congress on Engineering Coputer Science 2017 Vol II Roly r-orthogonal (g, f)-factorizations in Networks Sizhong Zhou Abstract Let G (V (G), E(G)) be a graph, where V (G) E(G) denote
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationBipartite graphs with at most six non-zero eigenvalues
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 11 (016) 315 35 Bipartite graphs with at most six non-zero eigenvalues
More informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
More informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationInverse Eigenvalue Problems for Two Special Acyclic Matrices
mathematics Communication Inverse Eigenvalue Problems for Two Special Acyclic Matrices Debashish Sharma, *, and Mausumi Sen, Department of Mathematics, Gurucharan College, College Road, Silchar 788004,
More informationEdge-counting vectors, Fibonacci cubes, and Fibonacci triangle
Publ. Math. Debrecen Manuscript (November 16, 2005) Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle By Sandi Klavžar and Iztok Peterin Abstract. Edge-counting vectors of subgraphs of Cartesian
More information8.1 Exponents and Roots
Section 8. Eponents and Roots 75 8. Eponents and Roots Before defining the net famil of functions, the eponential functions, we will need to discuss eponent notation in detail. As we shall see, eponents
More informationSolving Variable-Coefficient Fourth-Order ODEs with Polynomial Nonlinearity by Symmetric Homotopy Method
Applied and Computational Mathematics 218; 7(2): 58-7 http://www.sciencepublishinggroup.com/j/acm doi: 1.11648/j.acm.21872.14 ISSN: 2328-565 (Print); ISSN: 2328-5613 (Online) Solving Variable-Coefficient
More informationThe super line graph L 2
Discrete Mathematics 206 (1999) 51 61 www.elsevier.com/locate/disc The super line graph L 2 Jay S. Bagga a;, Lowell W. Beineke b, Badri N. Varma c a Department of Computer Science, College of Science and
More informationSteinberg s Conjecture
Steinberg s Conjecture Florian Hermanns September 5, 2013 Abstract Every planar graph without 4-cycles and 5-cycles is 3-colorable. This is Steinberg s conjecture, proposed in 1976 by Richard Steinberg.
More informationHamiltonicity of hypercubes with a constraint of required and faulty edges
J Comb Optim (2007) 14: 197 204 DOI 10.1007/s10878-007-9059-3 Hamiltonicity of hypercubes with a constraint of required and faulty edges Lih-Hsing Hsu Shu-Chung Liu Yeong-Nan Yeh Published online: 31 March
More informationEMBEDDED PATHS AND CYCLES IN FAULTY HYPERCUBES
EMBEDDED PATHS AND CYCLES IN FAULTY HYPERCUBES NELSON CASTAÑEDA AND IVAN S. GOTCHEV Abstract. An important task in the theory of hypercubes is to establish the maximum integer f n such that for every set
More informationOne-to-many node-disjoint paths in (n,k)-star graphs
One-to-many node-disjoint paths in (n,k)-star graphs Yonghong Xiang and Iain A. Stewart Department of Computer Science, Durham University, Science Labs, South Road, Durham DH1 3LE, U.K. e-mail: {yonghong.xiang,i.a.stewart}@durham.ac.uk
More informationTime-Frequency Analysis: Fourier Transforms and Wavelets
Chapter 4 Time-Frequenc Analsis: Fourier Transforms and Wavelets 4. Basics of Fourier Series 4.. Introduction Joseph Fourier (768-83) who gave his name to Fourier series, was not the first to use Fourier
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationThe Maze Generation Problem is NP-complete
The Mae Generation Problem is NP-complete Mario Alviano Department of Mathematics, Universit of Calabria, 87030 Rende (CS), Ital alviano@mat.unical.it Abstract. The Mae Generation problem has been presented
More informationON THE INTEGRALITY OF THE UNCAPACITATED FACILITY LOCATION POLYTOPE. 1. Introduction
ON THE INTEGRALITY OF THE UNCAPACITATED FACILITY LOCATION POLYTOPE MOURAD BAÏOU AND FRANCISCO BARAHONA Abstract We study a system of linear inequalities associated with the uncapacitated facility location
More information