Edge-pancyclicity of Möbius cubes

Size: px
Start display at page:

Download "Edge-pancyclicity of Möbius cubes"

Transcription

1 Information Processing Letters 96 (25) Edge-pancyclicity of Möbius cubes Min Xu a,b, Jun-Ming Xu b, a Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 18, China b Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 2326, China Received 4 March 24; received in revised form 6 July 25; accepted 13 July 25 Available online 25 August 25 Communicated by F. Schneider Abstract The Möbius cube M n is a variant of the hypercube Q n and has better properties than Q n with the same number of links and processors. It has been shown by Fan [J. Fan, Hamilton-connectivity and cycle-embedding of Möbius cubes, Inform. Process. Lett. 82 (22) ] and Huang et al. [W.-T. Huang, W.-K. Chen, C.-H. Chen, Pancyclicity of Möbius cubes, in: Proc. 9th Internat. Conf. on Parallel and Distributed Systems (ICPADS 2), 17 2 Dec. 22, pp ], independently, that M n contains a cycle of every length from 4 to 2 n. In this paper, we improve this result by showing that every edge of M n lies on a cycle of every length from 4 to 2 n inclusive. 25 Elsevier B.V. All rights reserved. Keywords: Combinatorial problems; Cycles; Möbius cubes; Hypercubes; Pancyclicity; Edge-pancyclicity 1. Introduction The hypercube network has proved to be one of the most popular interconnection networks. The Möbius cubes, proposed first by Cull and Larson [1 3], form a class of hypercube variants. Like hypercubes, Möbius cubes are expansible, have a simple routing algorithm, and have a high fault tolerance. The Möbius cubes are superior to the hypercube in having about half of The work was supported by NNSF of China (Nos , 13131, and ). * Corresponding author. address: xujm@ustc.edu.cn (J.-M. Xu). the diameter of the hypercube, about two-thirds of the average distance of hypercube. Various properties of Möbius cubes have been extensively investigated in the literature, see, for example, [1 5,7 9,13]. The cycle embedding problem is to find a cycle of given length in graph, which is of practical importance in interconnection networks (see Section in [11]). Recently, it has been shown by several authors that every edge of n-dimensional crossed cube, another variants of the hypercube, lies on a cycle of every length from 4 to 2 n inclusive for n 2(see[6, 1,12,14]). Fan [5] and Huang et al. [9] have proved that the n-dimensional Möbius cube contains a cycle of length 2-19/$ see front matter 25 Elsevier B.V. All rights reserved. doi:1.116/j.ipl

2 M. Xu, J.-M. Xu / Information Processing Letters 96 (25) from 4 to 2 n. In this paper, we improve this result by showing the following theorem. Theorem. Every edge of n-dimensional Möbius cube lies on a cycle of every length from 4 to 2 n inclusive for n 2. Corollary (Fan [5], Huang et al. [9]). Every n-dimensional Möbius cube M n contains a cycle of every length from 4 to 2 n inclusive for n 2. The proof of the theorem is in Section 3. In Section 2, the definition and basic properties of the n-dimensional Möbius cube M n are given. Fig. 1. -Möbius cube M Möbius cubes The architecture of an interconnection work is usually represented by a connected simple graph G = (V, E), where the vertex-set V is the set of processors and the edge-set E is the set of communication links in the network. The edge connecting two vertices x and y is denoted by (x, y). We follow [11] for graphtheoretical terminology and notation not defined here. An n-dimensional Möbius cube, denoted by M n, has 2 n vertices. Each vertex has a unique n-component binary vector on {, 1} for an address, also called an n-bit string. A vertex X = x 1 x 2 x n connects to n neighbors Y 1,Y 2,...,Y n, where each Y i satisfies one of the following rules: Y i = x 1 x i 1 x i x i+1 x n if x i 1 =, (1) Y i = x 1 x i 1 x i x i+1 x n if x i 1 = 1, (2) where x i is the complement of the bit x i in {, 1}. More informally, a vertex X connects to a neighbor that differs in a bit x i if x i 1 =, and to a neighbor that differs in bits x i through x n if x i 1 = 1. The connection between X and Y is undefined when i = 1, so we can assume x is either equal to or equal to 1, which gives us slightly different network topologies. If we assume x =, we call the network a -Möbius cube, denoted by Mn ; and if we assume x = 1, we call the network a 1-Möbius cube, denoted by Mn 1. Figs. 1 and 2 show the -Möbius cube M4 and the 1-Möbius cube M4 1. Fig Möbius cube M 1 4. According to the above definition, it is not difficult to see that Mn (respectively, M1 n ) can be recursively constructed from Mn 1 and M1 n 1 by adding 2 n 1 edges. For any vertex X = x 1 x 2 x n 1 in Mn 1 or Mn 1 1, we construct a new vertex X = x 1 x 2 x n, where x 2 = x 1,x 3 = x 2,...,x n = x n 1, then assigning x 1 = ifx is in M n 1,orx 1 = 1ifX is in M1 n 1. So Mn can be constructed by connecting all pairs of vertices that differ only in the first bit, and Mn 1 can be constructed by connecting all pairs of vertices that differ in the first through the nth bits. For short, we denote M n = L R, where L n 1 and R n 1 1, and call edges between L and R cross edges. Moreover, we write a cross edge as (u L,u R ), where u L L and u R R. An edge in M n is called a critical edge if its end-vertices differ in only the last bit x n. Note that if M n = L R then, for any two adjacent u L and v L in L, two vertices u R and v R in R are not always adjacent in R, and vice versa. However, it is clear from the rules (1) and (2) that if (u L,v L ) is a critical edge, then two vertices u R and v R in R must be adjacent in R, and vice versa. Critical edges play an important role in the proof of our theorem. A cycle

3 138 M. Xu, J.-M. Xu / Information Processing Letters 96 (25) in M n is called a 2-critical if it contains at least two critical edges. It is easy to see that every vertex in M n is incident with a critical edge and every cross edge lies on a 2-critical cycle of length four. Lemma. Every edge of M n lies on a 2-critical cycle of length 2 n for n 2. Proof. We prove the lemma by induction on n 2. Clearly the result is true for n = 2 since M 2 is a cycle of length 4. Assume that the lemma is true for every k with 2 k<n.letm n = L R and e be any edge in M n. There are two cases according as e is in Mn or Mn 1 Ċase 1. The edge e is in M n. Subcase 1.1. The edge e is in L. Since L n 1, by the induction hypothesis, there exists a 2-critical cycle C of length 2 n 1 in L that contains e. Choose a critical edge (u L,v L ) in C different from e and let P = C (u L,v L ). Obviously, e is in P. From the definition of L, we can write u L = B and v L = B1, where B is an (n 2)- bit string. Then u R = 1B and v R = 1B1 are adjacent in R. By the induction hypothesis, there exists a 2-critical cycle C of length 2 n 1 in R that contains the edge (u R,v R ).LetP = C (u R,v R ). Then P + (v L,v R ) + P + (u R,u L ) is a 2-critical cycle of length 2 n in Mn that contains the edge e. Subcase 1.2. The edge e is in R. The proof is similar to Subcase 1.1. The details are here omitted. Subcase 1.3. The edge e is a cross edge between L and R. Let e = (u L,u R ), u L = B inl and u R = 1B in R, where u is an (n 2)-bit string. Let v L = B1 and v R = 1B1. Then u L,v L,v R,u R,u L is a cycle of length four in Mn and contains e. By the induction hypothesis, there exist a 2-critical cycle C of length 2 n 1 in L that contains the edge (u L,v L ) and a 2-critical cycle C of length 2 n 1 in R that contains the edge (u R,v R ).LetP = C (u L,v L ) and P = C (u R,v R ). Then P + (v L,v R ) + P + (u R,u L ) is a 2-critical cycle of length 2 n in Mn that contains the edge e. Case 2. The edge e is in Mn 1. By the same argument as that used in Case 1, we can prove that the lemma is true for this case, and the details are here omitted. 3. Proof of theorem In this section, we give the proof of theorem stated in Introduction. Proof. We prove the theorem by induction on n 2. The theorem is true for n = 2. Since M3 3 1 from Fig. 3, we only need to prove that every edge of M3 lies on a cycle of every length from 4 to 8 inclusive. The union of the following four cycles of length four covers all edges of M3., 1, 11, 1,, 1, 11, 11, 111, 1,, 1, 11, 1,, 1, 11, 111, 11, 1. The union of the following four cycles of length five covers all edges of M 3. Fig. 3. (a) M 3 and (b) M1 3.

4 M. Xu, J.-M. Xu / Information Processing Letters 96 (25) , 1, 11, 111, 1,,, 1, 11, 111, 1,,, 1, 11, 11, 1,, 1, 11, 111, 11, 11, 1. The union of the following three cycles of length six covers all edges of M3., 1, 11, 111, 11, 1,,, 1, 11, 1, 11, 1,, 1, 111, 11, 11, 1,, 1. The union of the following three cycles of length seven covers all edges of M3., 1, 11, 11, 111, 11, 1,, 1, 11, 1, 111, 11, 1, 11, 1,, 1, 111, 11, 1, 11, 1,. The union of the following two cycles of length eight covers all edges of M3., 1, 11, 11, 1, 11, 111, 1,,, 1, 11, 1, 11, 111, 11, 1,. Thus the theorem is true for n = 3. Assume now that the theorem is true for all 3 k< n. Lete be any edge of M n and let l be any integer with 4 l 2 n, where n 4. To complete the proof of the theorem, we need to show that e is contained in a cycle of length l by considering two cases according as e is in Mn or in M1 n. Case 1. The edge e is in Mn.LetM n = L R. Subcase 1.1. The edge e is in L. Since L n 1, we can express L = L R, where L and R 1. If 4 l 2 n 1, by the induction hypothesis, there exists a cycle of length l in L Mn that contains e. Suppose that 2 n l 2 n By the induction hypothesis, there exists a cycle C of length l 3inL containing e. Forn 4, we have l 3 2 n 1 2 > 2, and so C contains at least two cross edges between L and R. Thus, we can choose a cross edge (u L,v L ) in C different from e. Let(u L,v L ) = (B,1B), where B is an (n 2)-bit string. Then u R = 1B, w R = 11 B, v R = 11B are in R with (u R,w R ), (w R,v R ) E(R) by the rule (2) in the definition of M n, i.e., P = v R,w R,u R is a path between v R and u R in R. LetP = C (u L,v L ). Then P contains e and P + (v L,v R ) + P + (u R,u L ) is a cycle of length l in Mn containing e. Suppose that 2 n l 2 n.letl = l 2 n 1. Then 4 l 2 n 1. By lemma, there exists a 2-critical cycle C of length 2 n 1 in L containing e. We can choose a critical edge (u L,v L ) different from e. Without loss of generality, let u L = B and v L = B1, where B is an (n 2)-bit string. Then u R = 1B and v R = 1B1 are adjacent in R. LetP = C (u L,v L ). Obviously e lies on P. By the induction hypothesis there exists a cycle C of length l in R that contains (u R,v R ).LetP = C (v R,u L ). Then P + (v L,v R ) + P + (u R,u L ) is a cycle of length l in Mn and contains e. Subcase 1.2. The edge e is in R. Since R n 1 1, we can express R = L 1 R 1, where L 1 and R 1 1. The proof is similar to Subcase 1.1. The details are here omitted. Subcase 1.3. The edge e is a cross edge between L and R. Let e = (u L,u R ) = (x 2 x 3 x n, 1x 2 x 3 x n ).Let v L = x 2 x 3 x n 1 x n and v R = 1x 2 x 3 x n 1 x n. Obviously, u L,v L,v R,u R,u L is a cycle of length four in Mn containing e. And x 2 x 3 x n, 1x 2 x 3 x n, 1 x 2 x 3 x n, x 2 x 3 x n, x 2 x 3 x 4 x n, x 2 x 3 x n is a cycle of length five in M n containing e for x 2 = ; x 2 x 3 x n, 1x 2 x 3 x n, 1 x 2 x 3 x n, x 2 x 3 x n, x 2 x 3 x 4 x n, x 2 x 3 x n is a cycle of length five in Mn containing e for x 2 = 1. For l 6, we can write l = l 1 + l 2 where l 1 = 2, 4 l 2 2 n 1 or 4 l 1 2 n 1, 4 l 2 2 n 1. Consider the cycle u L,v L,v R,u R,u L of length four in Mn containing e. By the induction hypothesis, there exists a cycle C of length l 1 in L containing (u L,v L ) if l 1 4 and exists a cycle C of length l 2 in R containing (u R,v R ).LetP = (u L,v L ) if l 1 = 2or P = C (u L,v L ) if l 1 4; P = C (v R,u R ). Then P + (v L,v R ) + P + (u R,u L ) is a cycle of length l in Mn and contains e. Case 2. The edge e is in Mn 1. By the same argument as that used in Case 1, we can prove that the theorem is true for this case, and the details are here omitted.

5 14 M. Xu, J.-M. Xu / Information Processing Letters 96 (25) References [1] P. Cull, S. Larson, The Möbius cubes cull, in: The Sixth Distributed Memory Computing Conference Proceedings, 28 April 1 May, 1991, pp [2] P. Cull, S. Larson, The Möbius cubes: improved cubelike networks for parallel computation, in: Proceedings of the Sixth International Parallel Processing Symposium, March 1992, pp [3] P. Cull, S.M. Larson, The Möbius cubes, IEEE Trans. Comput. 44 (5) (1995) [4] J. Fan, Diagnosability of Möbius cubes, IEEE Trans. Parallel Distrib. Syst. 9 (9) (1998) [5] J. Fan, Hamilton-connectivity and cycle-embedding of Möbius cubes, Inform. Process. Lett. 82 (22) [6] J. Fan, X. Lin, X. Jia, Node-pancyclicity and edge-pancyclicity of crossed cubes, Inform. Process. Lett. 93 (25) [7] S.Y. Hsieh, C.H. Chen, Pancyclicity on Möbius cubes with maximal edge faults, Parallel Comput. 3 (3) (24) [8] W.-T. Huang, Y. Chuang, J.J.M. Tan, L. Hsu, Fault-free Hamiltonian cycle in faulty Möbius cubes, Comput. Syst. 4 (2) (2) [9] W.-T. Huang, W.-K. Chen, C.-H. Chen, Pancyclicity of Möbius cubes, in: Proc. 9th Internat. Conf. on Parallel and Distributed Systems (ICPADS 2), 17 2 Dec. 22, pp [1] M. Ma, J.-M. Xu, Edge-pancyclicity of crossed cubes, J. China Univ. Sci. Tech. 35 (3) (25) [11] J.-M. Xu, Topological Structure and Analysis of Interconnection Networks, Kluwer Academic Publishers, Dordrecht, 21. [12] X. Yang, D.J. Evans, G.M. Megson, Y. Tang, On the pathconnectivity vertex-cyclicity and edge-pancyclicity of crossed cubes, Neural Parallel Sci. Comput. 13 (1) (25) [13] X. Yang, G.M. Megson, Fault tolerance of Möbus cubes under two forbidden fault set models, Internat. J. Comput. Math. 81 (8) (24) [14] X. Yang, G.M. Megson, On the double-vertex-cycle-connectivity of crossed cubes, Parallel Algorithms Appl. 19 (1) (24) 1 9.

The super connectivity of shuffle-cubes

The 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 information

Bipanconnectivity of Cartesian product networks

Bipanconnectivity 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 information

Constructing Independent Spanning Trees on Locally Twisted Cubes in Parallel

Constructing 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 information

Hybrid 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 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 information

Hyper-Panconnectedness of the Locally Twisted Cube

Hyper-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 information

ON THE EDGE-HYPER-HAMILTONIAN LACEABILITY OF BALANCED HYPERCUBES

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 information

ARTICLE IN PRESS Discrete Applied Mathematics ( )

ARTICLE 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 information

Algebraic Properties and Panconnectivity of Folded Hypercubes

Algebraic 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 information

PARALLEL computing is important for speeding up. Embedding Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles into Twisted Cubes

PARALLEL 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 information

arxiv: v1 [math.co] 27 Apr 2016

arxiv: 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 information

The Restricted Edge-Connectivity of Kautz Undirected Graphs

The 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 information

PARALLEL computing is important for speeding up

PARALLEL 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 information

All Good (Bad) Words Consisting of 5 Blocks

All 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 information

Improving the Height of Independent Spanning Trees on Folded Hyper-Stars

Improving 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 information

ARTICLE IN PRESS Theoretical Computer Science ( )

ARTICLE 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 information

Path Embeddings with Prescribed Edge in the Balanced Hypercube Network

Path Embeddings with Prescribed Edge in the Balanced Hypercube Network 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

More information

MAXIMAL VERTEX-CONNECTIVITY OF S n,k

MAXIMAL 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 information

Mutually Independent Hamiltonian Paths in Star Networks

Mutually 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 information

Theoretical Computer Science. Fault-free longest paths in star networks with conditional link faults

Theoretical 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 information

On Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci Cubes

On 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 information

Automorphism group of the balanced hypercube

Automorphism 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 information

Conquering Edge Faults in a Butterfly with Automorphisms

Conquering 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 information

Pancycles and Hamiltonian-Connectedness of the Hierarchical Cubic Network

Pancycles 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 information

Domination and Total Domination Contraction Numbers of Graphs

Domination 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 information

Tight Bounds on the Diameter of Gaussian Cubes

Tight Bounds on the Diameter of Gaussian Cubes Tight Bounds on the Diameter of Gaussian Cubes DING-MING KWAI AND BEHROOZ PARHAMI Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106 9560, USA Email: parhami@ece.ucsb.edu

More information

One-to-many node-disjoint paths in (n,k)-star graphs

One-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 information

EMBEDDED PATHS AND CYCLES IN FAULTY HYPERCUBES

EMBEDDED 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 information

Graph Theory and Interconnection Networks

Graph 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 information

An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs

An 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 information

Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles Λ

Gray 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 information

Disjoint Path Covers in Cubes of Connected Graphs

Disjoint Path Covers in Cubes of Connected Graphs Disjoint Path Covers in Cubes of Connected Graphs Jung-Heum Park a, Insung Ihm b, a School of Computer Science and Information Engineering The Catholic University of Korea, Bucheon, Korea b Department

More information

Hamiltonian problem on claw-free and almost distance-hereditary graphs

Hamiltonian problem on claw-free and almost distance-hereditary graphs Discrete Mathematics 308 (2008) 6558 6563 www.elsevier.com/locate/disc Note Hamiltonian problem on claw-free and almost distance-hereditary graphs Jinfeng Feng, Yubao Guo Lehrstuhl C für Mathematik, RWTH

More information

On binary reflected Gray codes and functions

On binary reflected Gray codes and functions Discrete Mathematics 308 (008) 1690 1700 www.elsevier.com/locate/disc On binary reflected Gray codes and functions Martin W. Bunder, Keith P. Tognetti, Glen E. Wheeler School of Mathematics and Applied

More information

q-counting hypercubes in Lucas cubes

q-counting hypercubes in Lucas cubes Turkish Journal of Mathematics http:// journals. tubitak. gov. tr/ math/ Research Article Turk J Math (2018) 42: 190 203 c TÜBİTAK doi:10.3906/mat-1605-2 q-counting hypercubes in Lucas cubes Elif SAYGI

More information

Independent even cycles in the Pancake graph and greedy Prefix reversal Gray codes.

Independent even cycles in the Pancake graph and greedy Prefix reversal Gray codes. Graphs and Combinatorics manuscript No. (will be inserted by the editor) Independent even cycles in the Pancake graph and greedy Prefix reversal Gray codes. Elena Konstantinova Alexey Medvedev Received:

More information

HAMILTONIAN PROPERTIES OF TRIANGULAR GRID GRAPHS. 1. Introduction

HAMILTONIAN PROPERTIES OF TRIANGULAR GRID GRAPHS. 1. Introduction HAMILTONIAN PROPERTIES OF TRIANGULAR GRID GRAPHS VALERY S. GORDON, YURY L. ORLOVICH, FRANK WERNER Abstract. A triangular grid graph is a finite induced subgraph of the infinite graph associated with the

More information

Distributed Algorithms of Finding the Unique Minimum Distance Dominating Set in Directed Split-Stars

Distributed Algorithms of Finding the Unique Minimum Distance Dominating Set in Directed Split-Stars Distributed Algorithms of Finding the Unique Minimum Distance Dominating Set in Directed Split-Stars Fu Hsing Wang 1 Jou Ming Chang 2 Yue Li Wang 1, 1 Department of Information Management, National Taiwan

More information

On zero-sum partitions and anti-magic trees

On zero-sum partitions and anti-magic trees Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,

More information

No.5 Node Grouping in System-Level Fault Diagnosis 475 identified under above strategy is precise in the sense that all nodes in F are truly faulty an

No.5 Node Grouping in System-Level Fault Diagnosis 475 identified under above strategy is precise in the sense that all nodes in F are truly faulty an Vol.16 No.5 J. Comput. Sci. & Technol. Sept. 2001 Node Grouping in System-Level Fault Diagnosis ZHANG Dafang (± ) 1, XIE Gaogang (ΞΛ ) 1 and MIN Yinghua ( ΠΦ) 2 1 Department of Computer Science, Hunan

More information

Channel graphs of bit permutation networks

Channel graphs of bit permutation networks Theoretical Computer Science 263 (2001) 139 143 www.elsevier.com/locate/tcs Channel graphs of bit permutation networks Li-Da Tong 1, Frank K. Hwang 2, Gerard J. Chang ;1 Department of Applied Mathematics,

More information

Equitable list colorings of planar graphs without short cycles

Equitable list colorings of planar graphs without short cycles Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs

More information

Conditional colorings of graphs

Conditional colorings of graphs Discrete Mathematics 306 (2006) 1997 2004 Note Conditional colorings of graphs www.elsevier.com/locate/disc Hong-Jian Lai a,d, Jianliang Lin b, Bruce Montgomery a, Taozhi Shui b, Suohai Fan c a Department

More information

Cycles in 4-Connected Planar Graphs

Cycles 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 information

Hamiltonicity of hypercubes with a constraint of required and faulty edges

Hamiltonicity 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 information

Binary construction of quantum codes of minimum distances five and six

Binary construction of quantum codes of minimum distances five and six Discrete Mathematics 308 2008) 1603 1611 www.elsevier.com/locate/disc Binary construction of quantum codes of minimum distances five and six Ruihu Li a, ueliang Li b a Department of Applied Mathematics

More information

Properties of Fibonacci languages

Properties of Fibonacci languages Discrete Mathematics 224 (2000) 215 223 www.elsevier.com/locate/disc Properties of Fibonacci languages S.S Yu a;, Yu-Kuang Zhao b a Department of Applied Mathematics, National Chung-Hsing University, Taichung,

More information

On Hamiltonian cycles and Hamiltonian paths

On Hamiltonian cycles and Hamiltonian paths Information Processing Letters 94 (2005) 37 41 www.elsevier.com/locate/ipl On Hamiltonian cycles and Hamiltonian paths M. Sohel Rahman a,, M. Kaykobad a,b a Department of Computer Science and Engineering,

More information

Recursion and Induction

Recursion and Induction Recursion and Induction Themes Recursion Recurrence Definitions Recursive Relations Induction (prove properties of recursive programs and objects defined recursively) Examples Tower of Hanoi Gray Codes

More information

arxiv: v1 [cs.gr] 25 Nov 2015

arxiv: v1 [cs.gr] 25 Nov 2015 EMBEDDING OF HYPERCUBE INTO CYLINDER WEIXING JI, QINGHUI LIU, GUIZHEN WANG, AND ZHUOJIA SHEN arxiv:1511.07932v1 [cs.gr] 25 Nov 2015 Abstract. Task mapping in modern high performance parallel computers

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

More information

Minimal enumerations of subsets of a nite set and the middle level problem

Minimal enumerations of subsets of a nite set and the middle level problem Discrete Applied Mathematics 114 (2001) 109 114 Minimal enumerations of subsets of a nite set and the middle level problem A.A. Evdokimov, A.L. Perezhogin 1 Sobolev Institute of Mathematics, Novosibirsk

More information

On Detecting Multiple Faults in Baseline Interconnection Networks

On Detecting Multiple Faults in Baseline Interconnection Networks On Detecting Multiple Faults in Baseline Interconnection Networks SHUN-SHII LIN 1 AND SHAN-TAI CHEN 2 1 National Taiwan Normal University, Taipei, Taiwan, ROC 2 Chung Cheng Institute of Technology, Tao-Yuan,

More information

The super line graph L 2

The 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 information

Inadmissible Class of Boolean Functions under Stuck-at Faults

Inadmissible Class of Boolean Functions under Stuck-at Faults Inadmissible Class of Boolean Functions under Stuck-at Faults Debesh K. Das 1, Debabani Chowdhury 1, Bhargab B. Bhattacharya 2, Tsutomu Sasao 3 1 Computer Sc. & Engg. Dept., Jadavpur University, Kolkata

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

More information

Constructing Node-Disjoint Paths in Enhanced Pyramid Networks

Constructing Node-Disjoint Paths in Enhanced Pyramid Networks Constructing Node-Disjoint Paths in Enhanced Pyramid Networks Hsien-Jone Hsieh 1 and Dyi-Rong Duh 2, * 1,2 Department of Computer Science and Information Engineering National Chi Nan University, Puli,

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics 309 (009) 3811 380 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Disjoint hamiltonian cycles in bipartite graphs Michael

More information

Determining The Pattern for 1- fault Tolerant Hamiltonian Cycle From Generalized Petersen Graph P(n,k)

Determining 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 information

Applied Mathematics Letters

Applied 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 information

The edge-diametric theorem in Hamming spaces

The edge-diametric theorem in Hamming spaces Discrete Applied Mathematics 56 2008 50 57 www.elsevier.com/locate/dam The edge-diametric theorem in Hamming spaces Christian Bey Otto-von-Guericke-Universität Magdeburg, Institut für Algebra und Geometrie,

More information

Biswapped Networks and Their Topological Properties

Biswapped Networks and Their Topological Properties Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing Biswapped Networks and Their Topological Properties Wenjun Xiao, Weidong

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 431 (29) 188 195 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Lattices associated with

More information

A class of heuristics for the constrained forest problem

A class of heuristics for the constrained forest problem Discrete Applied Mathematics 154 (2006) 6 14 www.elsevier.com/locate/dam Communication A class of heuristics for the constrained forest problem Michael Laszlo, Sumitra Mukherjee Nova Southeastern University,

More information

Cycles in the cycle prefix digraph

Cycles in the cycle prefix digraph Ars Combinatoria 60, pp. 171 180 (2001). Cycles in the cycle prefix digraph F. Comellas a, M. Mitjana b a Departament de Matemàtica Aplicada i Telemàtica, UPC Campus Nord, C3, 08034 Barcelona, Catalonia,

More information

An Ore-type Condition for Cyclability

An 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 information

Discrete Mathematics. The edge spectrum of the saturation number for small paths

Discrete Mathematics. The edge spectrum of the saturation number for small paths Discrete Mathematics 31 (01) 68 689 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The edge spectrum of the saturation number for

More information

Network synchronizability analysis: The theory of subgraphs and complementary graphs

Network synchronizability analysis: The theory of subgraphs and complementary graphs Physica D 237 (2008) 1006 1012 www.elsevier.com/locate/physd Network synchronizability analysis: The theory of subgraphs and complementary graphs Zhisheng Duan a,, Chao Liu a, Guanrong Chen a,b a State

More information

Spanning Paths in Infinite Planar Graphs

Spanning 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 information

Monotone Gray Codes and the Middle Levels Problem

Monotone Gray Codes and the Middle Levels Problem Monotone Gray Codes and the Middle Levels Problem Carla D. Savage Department of Computer Science North Carolina State University Raleigh, North Carolina 27695-8206 cds@adm.csc.ncsu.edu Peter Winkler Bellcore

More information

NOTE ON THE SKEW ENERGY OF ORIENTED GRAPHS. Communicated by Ivan Gutman. 1. Introduction

NOTE ON THE SKEW ENERGY OF ORIENTED GRAPHS. Communicated by Ivan Gutman. 1. Introduction Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 1 (2015), pp. 57-61. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir NOTE ON THE SKEW ENERGY OF

More information

arxiv: v2 [math.gr] 17 Dec 2017

arxiv: v2 [math.gr] 17 Dec 2017 The complement of proper power graphs of finite groups T. Anitha, R. Rajkumar arxiv:1601.03683v2 [math.gr] 17 Dec 2017 Department of Mathematics, The Gandhigram Rural Institute Deemed to be University,

More information

Uniquely 2-list colorable graphs

Uniquely 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 information

On a kind of restricted edge connectivity of graphs

On a kind of restricted edge connectivity of graphs Discrete Applied Mathematics 117 (2002) 183 193 On a kind of restricted edge connectivity of graphs Jixiang Meng a; ;1, Youhu Ji b a Department of Mathematics, Xinjiang University, Urumqi 830046, Xinjiang,

More information

Partial cubes: structures, characterizations, and constructions

Partial cubes: structures, characterizations, and constructions Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes

More information

arxiv: v1 [math.co] 13 May 2016

arxiv: v1 [math.co] 13 May 2016 GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in

More information

Node-to-set disjoint-path routing in perfect hierarchical hypercubes

Node-to-set disjoint-path routing in perfect hierarchical hypercubes Available online at www.sciencedirect.com Procedia Computer Science 4 (2011) 442 451 International Conference on Computational Science, ICCS 2011 Node-to-set disoint-path routing in perfect hierarchical

More information

MATH 22 HAMILTONIAN GRAPHS. Lecture V: 11/18/2003

MATH 22 HAMILTONIAN GRAPHS. Lecture V: 11/18/2003 MATH 22 Lecture V: 11/18/2003 HAMILTONIAN GRAPHS All communities [graphs] divide themselves into the few and the many [i.e., are bipartite]. Alexander Hamilton, Debates of the Federal Convention Before

More information

Generalized Fibonacci cubes

Generalized Fibonacci cubes Generalized Fibonacci cubes Aleksandar Ilić Faculty of Sciences and Mathematics University of Niš, Serbia e-mail: aleksandari@gmail.com Sandi Klavžar Faculty of Mathematics and Physics University of Ljubljana,

More information

Multiple-Edge-Fault Tolerance with Respect to Hypercubes

Multiple-Edge-Fault Tolerance with Respect to Hypercubes IEEE TRANSACTINS N ARAE AND DISTRIBUTED SYSTES, V. 8, N. 2, FEBRUARY 1997 187 ultiple-edge-fault Tolerance with Respect to Hypercubes Ting-Yi Sung, en-yang in, and Tung-Yang Ho Abstract revious works on

More information

Small Cycle Cover of 2-Connected Cubic Graphs

Small Cycle Cover of 2-Connected Cubic Graphs . Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of

More information

arxiv: v1 [cs.dm] 12 Jun 2016

arxiv: v1 [cs.dm] 12 Jun 2016 A Simple Extension of Dirac s Theorem on Hamiltonicity Yasemin Büyükçolak a,, Didem Gözüpek b, Sibel Özkana, Mordechai Shalom c,d,1 a Department of Mathematics, Gebze Technical University, Kocaeli, Turkey

More information

A New Variation of Hat Guessing Games

A New Variation of Hat Guessing Games A New Variation of Hat Guessing Games Tengyu Ma 1, Xiaoming Sun 1, and Huacheng Yu 1 Institute for Theoretical Computer Science Tsinghua University, Beijing, China Abstract. Several variations of hat guessing

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,

More information

Spectral radii of graphs with given chromatic number

Spectral radii of graphs with given chromatic number Applied Mathematics Letters 0 (007 158 16 wwwelseviercom/locate/aml Spectral radii of graphs with given chromatic number Lihua Feng, Qiao Li, Xiao-Dong Zhang Department of Mathematics, Shanghai Jiao Tong

More information

Projective synchronization of a complex network with different fractional order chaos nodes

Projective 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 information

L(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

L(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 information

On the Randić index. Huiqing Liu. School of Mathematics and Computer Science, Hubei University, Wuhan , China

On the Randić index. Huiqing Liu. School of Mathematics and Computer Science, Hubei University, Wuhan , China Journal of Mathematical Chemistry Vol. 38, No. 3, October 005 ( 005) DOI: 0.007/s090-005-584-7 On the Randić index Huiqing Liu School of Mathematics and Computer Science, Hubei University, Wuhan 43006,

More information

INTERPOLATION THEOREMS FOR A FAMILY OF SPANNING SUBGRAPHS. SANMING ZHOU, Hong Kong

INTERPOLATION THEOREMS FOR A FAMILY OF SPANNING SUBGRAPHS. SANMING ZHOU, Hong Kong Czechoslovak Mathematical Journal, 48 (123) (1998), Praha INTERPOLATION THEOREMS FOR A FAMILY OF SPANNING SUBGRAPHS SANMING ZHOU, Hong Kong (Received March 20, 1995) Abstract. Let G be a graph with order

More information

Decomposition of random graphs into complete bipartite graphs

Decomposition of random graphs into complete bipartite graphs Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg of edge-disjoint

More information

Discrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability

Discrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect

More information

The adjacent vertex-distinguishing total chromatic number of 1-tree

The adjacent vertex-distinguishing total chromatic number of 1-tree The adjacent ertex-distinguishing total chromatic number of 1-tree Haiying Wang The School of Information Engineering China Uniersity of Geosciences(Beijing) Beijing 100083, P.R.China Abstract Let G =

More information

Hamilton cycles and closed trails in iterated line graphs

Hamilton cycles and closed trails in iterated line graphs Hamilton cycles and closed trails in iterated line graphs Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 USA Iqbalunnisa, Ramanujan Institute University of Madras, Madras

More information

TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV

TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. In our quest to find a splitter theorem for internally 4-connected binary

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

More information

Path decompositions and Gallai s conjecture

Path decompositions and Gallai s conjecture Journal of Combinatorial Theory, Series B 93 (005) 117 15 www.elsevier.com/locate/jctb Path decompositions and Gallai s conjecture Genghua Fan Department of Mathematics, Fuzhou University, Fuzhou, Fujian

More information

SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS

SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS Arash Asadi Luke Postle 1 Robin Thomas 2 School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT

More information

Laplacian spectral radius of trees with given maximum degree

Laplacian spectral radius of trees with given maximum degree Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 1962 1969 www.elsevier.com/locate/laa Laplacian spectral radius of trees with given maximum degree Aimei Yu a,,1,

More information

European Journal of Combinatorics

European Journal of Combinatorics European Journal of Combinatorics 31 (2010) 780 789 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Hypergroups and n-ary relations

More information

The number of spanning trees in a new lexicographic product of graphs

The number of spanning trees in a new lexicographic product of graphs RESEARCH PAPER SCIENCE CHINA Information Sciences doi: 101007/s11432-014-5110-z The number of spanning trees in a new lexicographic product of graphs LIANG Dong 13 LIFeng 123 & XU ZongBen 13 1 Institute

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics 310 (2010) 109 114 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Total palindrome complexity of finite words Mira-Cristiana

More information