Xu, Jun-Ming - Department of Mathematics, University of Science and Technology of China

• TAIWANESE JOURNAL OF MATHEMATICS Vol. 9, No. 4, pp. 661-670, December 2005
• 32 1 --,,oe ...... i Vol. 32 ,No. 1 2 0 0 2 ~OE2 JOURNAL OF UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA Feb. 2 0 0 2
• The Restricted Edge-Connectivity of Kautz Undirected Graphs
• Fault-tolerant edge-pancyclicity of locally twisted cubes q Xirong Xu a
• 16 1 ,, Vol. 16 ,No. 1 2007 ~OE2 OPERA TIONS RESEARCH AND MANA GEMEN T SCIENCE Feb. 2007
• TAIWANESE JOURNAL OF MATHEMATICS Vol. 10, No. 5, pp. 1305-1315, September 2006
• Weak Edge-Pancyclicity of Locally Twisted Cubes
• An InternationalJournal Available online at www.sciencedirect.com__ computers &
• On Super Edge-Connectivity of Cartesian Product Graphs Min L and Guo-Liang Chen
• A New Upper Bound On Forwarding Index of Graphs
• Discrete Applied Mathematics 145 (2005) 490492 www.elsevier.com/locate/dam
• Information Processing Letters 94 (2005) 191195 www.elsevier.com/locate/ipl
• Opuscula Mathematica Vol. 29 No. 2 2009 You Lu, Xinmin Hou, Jun-Ming Xu
• 32 4 --,,oe ...... i Vol. 32 ,No. 4 2 0 0 2 ~OE8 JOURNAL OF UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA Aug. 2 0 0 2
• The Proof of a Conjecture of Bouabdallah and Sotteau Min Xu, Xinmin Hou and Jun-Ming Xu
• Information Processing Letters 93 (2005) 245248 www.elsevier.com/locate/ipl
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• (2008 6 9 ) 2008 6 6 Connectivity and Edge-connectivity of
• Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes q
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• Graphs and Combinatorics (2011) 27:129141 DOI 10.1007/s00373-010-0956-3
• Edge fault tolerance analysis of a class of interconnection networks q
• Algebraic Properties and Panconnectivity of Folded
• Information Processing Letters 97 (2006) 9497 www.elsevier.com/locate/ipl
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• Acta Mathematicae Applicatae Sinica, English Series Vol. 19, No. 2 (2003) 247254
• Information Processing Letters 109 (2009) 592593 Contents lists available at ScienceDirect
• Information Processing Letters 103 (2007) 5256 www.elsevier.com/locate/ipl
• Annals of Combinatorics Ars Combinatoria
• Author's personal copy Discrete Applied Mathematics 157 (2009) 11131127
• (2007 5 31 ) 2007 5 31 Applied Mathematics Letters
• Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes q
• 2006 3 10 1 March, 2006 OR Transactions Vol.10 No.1
• , AO:, . l<, t, orv, F"v,uL,
• Information Processing Letters 101 (2007) 185189 www.elsevier.com/locate/ipl
• The Restricted Edge-Connectivity of de Bruijn Undirected Graphs
• Highly Fault-Tolerant Routings in Some Cartesian Product Digraphs
• "L......^fl,~, , ,--~ , floe~",,,, , l...~"--""--<""L~~OE... ,
• Information Processing Letters 96 (2005) 136140 www.elsevier.com/locate/ipl
• Acta Mathematica Sinica, English Series Jan., 2011, Vol. 27, No. 1, pp. 169184
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• J Supercomput (2011) 56: 182189 DOI 10.1007/s11227-009-0356-8
• (--,,oe......i ," 230026) "" l G( N ; r , s) --N , 0 ,1 ,2 , > , N -1 ,^, i `
• 31 6 --,,oe ...... i Vol. 31 ,No. 6 2 0 0 1 ~OE1 2 JOURNAL OF CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY Dec. 2 0 0 1
• 32 2 --,,oe ...... i Vol. 32 ,No. 2 2 0 0 2 ~OE4 JOURNAL OF UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA Apr. 2 0 0 2
• Journal of Combinatorial Optimization, 8, 171181, 2004 c 2004 Kluwer Academic Publishers. Manufactured in The Netherlands.
• MATHEMATICA APPLICATA 2004 ,17(2) :329 332
• AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 30 (2004), Pages 4149
• Information Processing Letters 96 (2005) 146150 www.elsevier.com/locate/ipl
• Applied Mathematics Letters 19 (2006) 140145 www.elsevier.com/locate/aml
• Discrete Mathematics 306 (2006) 159165 www.elsevier.com/locate/disc
• 26 3 Vol.26, No.3 2006 8 JOURNAL OF MATHEMATICAL RESEARCH AND EXPOSITION Aug., 2006
• Discrete Mathematics 306 (2006) 29432953 www.elsevier.com/locate/disc
• On reliability of the folded hypercubes q Qiang Zhu a
• Discrete Mathematics 307 (2007) 15891599 www.elsevier.com/locate/disc
• Discrete Mathematics 307 (2007) 18811897 www.elsevier.com/locate/disc
• Computers and Mathematics with Applications 53 (2007) 12061213 www.elsevier.com/locate/camwa
• Discrete Mathematics 308 (2008) 571582 www.elsevier.com/locate/disc
• This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
• Journal of Mathematical Research & Exposition May, 2008, Vol. 28, No. 2, pp. 266272
• Restricted Edge-Connectivity of de Bruijn Jun-Ming Xu
• On (a, d)-Antimagic Labelings of Generalized Petersen Graphs
• Front. Math. China 2009, 4(2): 217252 DOI 10.1007/s11464-009-0017-5
• The Forwarding Indices of Wrapped Butterfly Networks Xinmin Hou and Jun-Ming Xu
• Discrete Applied Mathematics 157 (2009) 32493257 Contents lists available at ScienceDirect
• Front. Math. China 2009, 4(4): 697719 DOI 10.1007/s11464-009-0042-4
• On Super and Restricted Connectivity of Some Interconnection Networks
• Connectivity and super-connectivity of Cartesian product graphs
• PLEASE SCROLL DOWN FOR ARTICLE This article was downloaded by: [Pan, Yong-Liang][University of Science and Technology of China]
• Hints to Exercises in Chapter 1 Ex1.2.6 By (G) = (Gc
• , Elspas [27] . , : d, k n(d, k).
• Menger Kuratowski Ramsey Whitney Dirac Konig Tutte Erdos Menger Kuratowski Ramsey
• d'/Forwarding Index of Cube-Connected Cycles0uuv32009 c' 5Discrete Applied Mathematics6I157 I1 "'uvk~/0 qF<
• NP-Hard Problems in Networks 1 Disjoint Paths for Bounded Length
• On Distance Connected Domination Numbers of Graphs
• 80 70 A,B,C http://www.mapquest.com/directions/main.adp?
• Acta Mathematicae Applicatae Sinica, English Series Vol. 22, No. 1 (2006) 4348
• The Table of Errata Places Wrong True
• (This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached
• Discrete Mathematics 243 (2002) 291298 www.elsevier.com/locate/disc
• DOI: 10.1007/s10910-006-9017-9 Journal of Mathematical Chemistry, Vol. 40, No. 2, August 2006 ( 2006)
• (2009 c2 1 F) G7J13/IcEM50pD"Q3uE
• Information Processing Letters 106 (2008) 5963 www.elsevier.com/locate/ipl
• TAIWANESE JOURNAL OF MATHEMATICS Vol. 15, No. 3, pp. 1101-1113, June 2011
• Discussiones Mathematicae Graph Theory 30 (2010) 425435
• Domination and Total Domination Contraction Numbers of Graphs
• 300 16 1993 2003 2008
• 31 1 --,,oe ...... i Vol. 31 ,No. 1 2 0 0 1 ~OE2 JOURNAL OF CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY Feb. 2 0 0 1
• Author's personal copy Discrete Mathematics 309 (2009) 10011006
• AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 43 (2009), Pages 181190
• Discrete Applied Mathematics 157 (2009) 19381946 Contents lists available at ScienceDirect
• (2007.01-2009.12. : 10671191) xujm@ustc.edu.cn
• Discrete Applied Mathematics 105 (2000) 137145 On (d; 2)-dominating numbers of binary undirected
• Information Processing Letters 103 (2007) 222226 www.elsevier.com/locate/ipl
• Discrete Mathematics 310 (2010) 877886 Contents lists available at ScienceDirect
• Reliability of Interconnection Networks Modeled by Cartesian Product Digraphs
• Information Processing Letters 102 (2007) 226228 www.elsevier.com/locate/ipl
• NP-Hard Problems in Networks Exercises
• Theoretical Computer Science 407 (2008) 110116 Contents lists available at ScienceDirect
• Information Processing Letters 96 (2005) 123127 www.elsevier.com/locate/ipl
• http://www.paper.edu.cn 1954-. E-mail: yuqiu@vip.citiz.net
• Theoretical Computer Science 410 (2009) 38043813 Contents lists available at ScienceDirect
• MATHEMATICA APPLICATA 2004 ,17(supplement) :56 60
• (2003.01-2005.12. :10271114) xujm@ustc.edu.cn
• Discussiones Mathematicae Graph Theory 30 (2010) 185199
• Acta M athematica Scien tia 2004, 24A (2): 168-176
• Applied Mathematics Letters 19 (2006) 681685 www.elsevier.com/locate/aml
• Exercises in Chapter 3 Exercises 3.1
• Discrete Mathematics 302 (2005) 2231 www.elsevier.com/locate/disc
• Exercises in Chapter 1 Exercises 1.1
• Exercises in Chapter 4 Exercises 4.1
• 1.3. VERTEX DEGREES 11 1.3 Vertex Degrees
• Reinhard Diestel Graph Theory
• Theory and Application Department of Mathematics
• Exercises in Chapter 2 Exercises 2.1
• 9A^1 3 t pJ 2010 c 3 1 6 g
• Exercises in Chapter 6 Exercises 6.1
• Information Processing Letters 111 (2011) 10371043 Contents lists available at ScienceDirect
• Exercises in Chapter 5 Exercises 5.1
• 6.1. VERTEX COLORINGS 219 Vertex Colorings
• 202 Matchings and Independent Sets 5.5 The Travelling Salesman Problem
• Coloring Theory Origin of Coloring Theory
• 8 Super Connectivity of Line Graphs In this section, we consider connectedness and connectivity of the line graph of a graph
• A pp l. M ath. J. Ch inese U niv. S er. B 1999, 14(3): 3662370
• 192 Matchings and Independent Sets The Personnel Assignment Problem
• Trees with unique minimum p-dominating sets You Lu, Xinmin Hou
• Vg~'<5'(J" kVg1 )VgU#P'"
• AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 52 (2012), Pages 39
• The Bondage Number of Graphs with Crossing Number Less than Four
• Connectivity of lexicographic product and direct product of graphs
• Symmetry of Graphs or According to the basic principles of network design, one desires that designed
• Acta Mathematica Sinica, English Series Mar., 2012, Vol. 28, No. 3, pp. 453462
• Front. Math. China DOI 10.1007/s11464-012-0173-x
• Combinatorial Theory in Networks
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research