A combinatorial problem related to distributed loop networks. - Ding-Zhu Du; D. Frank Hsu; Qiao Li; Junming Xu 001 (Networks, 1990)

The Infinite Families of Optimal Double Loop Networks. - Q. Li; Jun-Ming Xu 001; Z. L. Zhang (Discret. Appl. Math., 1993)

A very short proof of a conjecture concerning set-to-set broadcasting. - Qiao Li; Zhongliang Zhang; Junming Xu 001 (Networks, 1993)

A sufficient condition for equality of arc-connectivity and minimum degree of a diagraph. - Jun-Ming Xu 001 (Discret. Math., 1994)

2-diameter of de Bruijn graphs. - Qiao Li; Dominique Sotteau; Junming Xu 001 (Networks, 1996)

On restricted edge-connectivity of graphs. - Jun-Ming Xu 001; Ke-Li Xu (Discret. Math., 2002)

2-restricted edge connectivity of vertex-transitive graphs. - Jun-Ming Xu 001; Qi Liu (Australas. J Comb., 2004)

Wide Diameters of Cartesian Product Graphs and Digraphs. - Jun-Ming Xu 001 (J. Comb. Optim., 2004)

The proof of a conjecture of Bouabdallah and Sotteau. - Min Xu 005; Xinmin Hou; Jun-Ming Xu 001 (Networks, 2004)

Forwarding indices of folded n-cubes. - Xinmin Hou; Min Xu 005; Jun-Ming Xu 001 (Discret. Appl. Math., 2005)

Edge-fault-tolerant edge-bipancyclicity of hypercubes. - Jun-Ming Xu 001; Zheng-Zhong Du; Min Xu 005 (Inf. Process. Lett., 2005)

Super connectivity of line graphs. - Jun-Ming Xu 001; Min Lü; Meijie Ma; Angelika Hellwig (Inf. Process. Lett., 2005)

Edge-pancyclicity of Möbius cubes. - Min Xu 005; Jun-Ming Xu 001 (Inf. Process. Lett., 2005)

Fault diameter of Cartesian product graphs. - Min Xu 005; Junming Xu 001; Xinmin Hou (Inf. Process. Lett., 2005)

The super connectivity of shuffle-cubes. - Jun-Ming Xu 001; Min Xu 005; Qiang Zhu 003 (Inf. Process. Lett., 2005)

Wide Diameter of Möbius Cubes. - Jun-Ming Xu 001; Zhi-Guo Deng (J. Interconnect. Networks, 2005)

Edge-fault-tolerant properties of hypercubes and folded hypercubes. - Jun-Ming Xu 001; Meijie Ma; Zheng-Zhong Du (Australas. J Comb., 2006)

Edge fault tolerance analysis of a class of interconnection networks. - Qiang Zhu 003; Jun-Ming Xu 001; Min Lv (Appl. Math. Comput., 2006)

Panconnectivity of locally twisted cubes. - Meijie Ma; Jun-Ming Xu 001 (Appl. Math. Lett., 2006)

Cycles in folded hypercubes. - Jun-Ming Xu 001; Meijie Ma (Appl. Math. Lett., 2006)

The Restricted Edge-Connectivity of Kautz Undirected Graphs. - Ying-Mei Fan; Jun-Ming Xu 001; Min Lü (Ars Comb., 2006)

The bondage numbers of extended de Bruijn and Kautz digraphs. - Jia Huang; Jun-Ming Xu 001 (Comput. Math. Appl., 2006)

Distance irredundance and connected domination numbers of a graph. - Jun-Ming Xu 001; Fang Tian; Jia Huang (Discret. Math., 2006)

Connectivity of Cartesian product graphs. - Jun-Ming Xu 001; Chao Yang 003 (Discret. Math., 2006)

Paths in Möbius cubes and crossed cubes. - Jun-Ming Xu 001; Meijie Ma; Min Lü (Inf. Process. Lett., 2006)

Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes. - Min Xu 005; Xiao-Dong Hu 001; Jun-Ming Xu 001 (Appl. Math. Comput., 2007)

On Distance Connected Domination Numbers of Graphs. - Fang Tian; Jun-Ming Xu 001 (Ars Comb., 2007)

The Restricted Edge-Connectivity of de Bruijn Undirected Graphs. - Jun-Ming Xu 001; Min Lü; Ying-Mei Fan (Ars Comb., 2007)

A New Upper Bound On Forwarding Index of Graphs. - Jun-Ming Xu 001; Tao Zhou; Ye Du; Jun Yan (Ars Comb., 2007)

The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs. - Jia Huang; Jun-Ming Xu 001 (Comput. Math. Appl., 2007)

The bondage numbers of graphs with small crossing numbers. - Jia Huang; Jun-Ming Xu 001 (Discret. Math., 2007)

Feedback numbers of Kautz digraphs. - Jun-Ming Xu 001; Yezhou Wu; Jia Huang; Chao Yang 003 (Discret. Math., 2007)

Fault-tolerant pancyclicity of augmented cubes. - Weiwei Wang; Meijie Ma; Jun-Ming Xu 001 (Inf. Process. Lett., 2007)

The forwarding indices of augmented cubes. - Min Xu 005; Jun-Ming Xu 001 (Inf. Process. Lett., 2007)

Fault diameter of product graphs. - Jun-Ming Xu 001; Chao Yang 003 (Inf. Process. Lett., 2007)

Fault-tolerant analysis of a class of networks. - Jun-Ming Xu 001; Qiang Zhu 003; Min Xu 005 (Inf. Process. Lett., 2007)

On reliability of the folded hypercubes. - Qiang Zhu 003; Jun-Ming Xu 001; Xinmin Hou; Min Xu 005 (Inf. Sci., 2007)

On super edge-connectivity of Cartesian product graphs. - Min Lü; Guo-Liang Chen 001; Jun-Ming Xu 001 (Networks, 2007)

Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes. - Meijie Ma; Guizhen Liu; Jun-Ming Xu 001 (Parallel Comput., 2007)

Distance domination-critical graphs. - Fang Tian; Jun-Ming Xu 001 (Appl. Math. Lett., 2008)

Weakly Edge-Pancyclicity of Locally Twisted Cubes. - Meijie Ma; Jun-Ming Xu 001 (Ars Comb., 2008)

Restricted Edge-Connectivity of de Bruijn Digraphs. - Jun-Ming Xu 001; Min Lü (Ars Comb., 2008)

The bondage numbers and efficient dominations of vertex-transitive graphs. - Jia Huang; Jun-Ming Xu 001 (Discret. Math., 2008)

The super connectivity of augmented cubes. - Meijie Ma; Guizhen Liu; Jun-Ming Xu 001 (Inf. Process. Lett., 2008)

Reliability of interconnection networks modeled by Cartesian product digraphs. - Chao Yang 003; Jun-Ming Xu 001 (Networks, 2008)

Fault-tolerant embedding of paths in crossed cubes. - Meijie Ma; Guizhen Liu; Jun-Ming Xu 001 (Theor. Comput. Sci., 2008)

A note on distance domination numbers of graphs. - Fang Tian; Jun-Ming Xu 001 (Australas. J Comb., 2009)

On (a, d)-Antimagic Labelings of Generalized Petersen Graphs. - Xirong Xu; Jun-Ming Xu 001; Min Lü; Baosheng Zhang; Nan Cao (Ars Comb., 2009)

Reinforcement numbers of digraphs. - Jia Huang; Jian-Wei Wang; Jun-Ming Xu 001 (Discret. Appl. Math., 2009)

Bounded edge-connectivity and edge-persistence of Cartesian product of graphs. - You Lu 002; Jun-Ming Xu 001; Xinmin Hou (Discret. Appl. Math., 2009)

Average distances and distance domination numbers. - Fang Tian; Jun-Ming Xu 001 (Discret. Appl. Math., 2009)

Forwarding index of cube-connected cycles. - Jun Yan; Jun-Ming Xu 001; Chao Yang 003 (Discret. Appl. Math., 2009)

Diameter vulnerability of graphs by edge deletion. - He-Xi Ye; Chao Yang 003; Jun-Ming Xu 001 (Discret. Math., 2009)

A note on "The super connectivity of augmented cubes". - Meijie Ma; Xuegong Tan; Jun-Ming Xu 001; Guizhen Liu (Inf. Process. Lett., 2009)

Edge-fault-tolerant bipanconnectivity of hypercubes. - Hai-Liang Wang; Jian-Wei Wang; Jun-Ming Xu 001 (Inf. Sci., 2009)

The forwarding indices of wrapped butterfly networks. - Xinmin Hou; Jun-Ming Xu 001; Min Xu 005 (Networks, 2009)

Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs. - Zi-Long Liu; Fang Tian; Jun-Ming Xu 001 (Theor. Comput. Sci., 2009)

Bipanconnectivity of Cartesian product networks. - You Lu 002; Jun-Ming Xu 001 (Australas. J Comb., 2010)

Domination and Total Domination Contraction Numbers of Graphs. - Jia Huang; Jun-Ming Xu 001 (Ars Comb., 2010)

Algebraic Properties and Panconnectivity of Folded Hypercubes. - Meijie Ma; Jun-Ming Xu 001 (Ars Comb., 2010)

On Super and Restricted Connectivity of Some Interconnection Networks. - Jun-Ming Xu 001; Jian-Wei Wang; Weiwei Wang (Ars Comb., 2010)

Connectivity and super-connectivity of Cartesian product graphs. - Jun-Ming Xu 001; Chao Yang 003 (Ars Comb., 2010)

Feedback numbers of de Bruijn digraphs. - Xirong Xu; Yongchang Cao; Jun-Ming Xu 001; Yezhou Wu (Comput. Math. Appl., 2010)

A new class of transitive graphs. - Fu-Tao Hu; Jian-Wei Wang; Jun-Ming Xu 001 (Discret. Math., 2010)

A characterization of (γt, γ2)-trees. - Xinmin Hou; Ning Li; You Lu 002; Jun-Ming Xu 001 (Discuss. Math. Graph Theory, 2010)

On the (2, 2)-domination number of trees. - Xinmin Hou; You Lu 002; Jun-Ming Xu 001 (Discuss. Math. Graph Theory, 2010)

The Menger number of the Cartesian product of graphs. - Meijie Ma; Jun-Ming Xu 001; Qiang Zhu 003 (Appl. Math. Lett., 2011)

Highly Fault-Tolerant Routings in Some Cartesian Product Digraphs. - Xiangfeng Pan; Meijie Ma; Jun-Ming Xu 001 (Ars Comb., 2011)

Complexity of Bondage and Reinforcement - Fu-Tao Hu; Jun-Ming Xu 001 (CoRR, 2011)

The p-Bondage Number of Trees. - You Lu 002; Jun-Ming Xu 001 (Graphs Comb., 2011)

A note on cycle embedding in hypercubes with faulty vertices. - Zheng-Zhong Du; Jun-Ming Xu 001 (Inf. Process. Lett., 2011)

Conditional fault tolerance of arrangement graphs. - Shuming Zhou; Jun-Ming Xu 001 (Inf. Process. Lett., 2011)

Fault-tolerant edge-pancyclicity of locally twisted cubes. - Xirong Xu; Wenhua Zhai; Jun-Ming Xu 001; Aihua Deng; Yuansheng Yang (Inf. Sci., 2011)

Panconnectivity of Cartesian product graphs. - You Lu 002; Jun-Ming Xu 001 (J. Supercomput., 2011)

Feedback numbers of Kautz undirected graphs. - Xirong Xu; Jian Wang; Jun-Ming Xu 001; Yongchang Cao (Australas. J Comb., 2012)

The Forwarding Indices of Graphs – a Survey - Jun-Ming Xu 001; Min Xu 005 (CoRR, 2012)

Conditional Fault Diagnosis of Bubble Sort Graphs under the PMC Model - Shuming Zhou; Jian Wang; Xirong Xu; Jun-Ming Xu 001 (CoRR, 2012)

The total bondage number of grid graphs. - Fu-Tao Hu; You Lu 002; Jun-Ming Xu 001 (Discret. Appl. Math., 2012)

Conditional fault diagnosis of hierarchical hypercubes. - Shuming Zhou; Limei Lin; Jun-Ming Xu 001 (Int. J. Comput. Math., 2012)

Conditional Fault Diagnosability of Dual-Cubes. - Shuming Zhou; Lanxiang Chen; Jun-Ming Xu 001 (Int. J. Found. Comput. Sci., 2012)

On the bounds of feedback numbers of (n, k)-star graphs. - Jian Wang; Xirong Xu; Dejun Zhu; Liqing Gao; Jun-Ming Xu 001 (Inf. Process. Lett., 2012)

On the complexity of the bondage and reinforcement problems. - Fu-Tao Hu; Jun-Ming Xu 001 (J. Complex., 2012)

The Bondage Number of Graphs with Crossing Number Less than Four. - Yongchang Cao; Jia Huang; Jun-Ming Xu 001 (Ars Comb., 2013)

Connectivity of lexicographic product and direct product of graphs. - Chao Yang 003; Jun-Ming Xu 001 (Ars Comb., 2013)

On the Roman bondage Number of a Graph. - A. Bahremandpour; Fu-Tao Hu; Seyed Mahmoud Sheikholeslami; Jun-Ming Xu 001 (Discret. Math. Algorithms Appl., 2013)

The Signed Edge-Domatic Number of a Graph. - Xiang-Jun Li; Jun-Ming Xu 001 (Graphs Comb., 2013)

Generalized measures of fault tolerance in exchanged hypercubes. - Xiang-Jun Li; Jun-Ming Xu 001 (Inf. Process. Lett., 2013)

Edge-fault tolerance of hypercube-like networks. - Xiang-Jun Li; Jun-Ming Xu 001 (Inf. Process. Lett., 2013)

Minimum feedback arc set of m-free digraphs. - Hao Liang; Jun-Ming Xu 001 (Inf. Process. Lett., 2013)

Fault diagnosability of arrangement graphs. - Shuming Zhou; Jun-Ming Xu 001 (Inf. Sci., 2013)

Roman bondage numbers of some graphs. - Fu-Tao Hu; Jun-Ming Xu 001 (Australas. J Comb., 2014)

Fault-tolerance of (n, k)-star networks. - Xiang-Jun Li; Jun-Ming Xu 001 (Appl. Math. Comput., 2014)

Trees with maximum p-reinforcement number. - You Lu 002; Jun-Ming Xu 001 (Discret. Appl. Math., 2014)

The p-domination number of complete multipartite graphs. - You Lu 002; Jun-Ming Xu 001 (Discret. Math. Algorithms Appl., 2014)

Total and paired domination numbers of toroidal meshes. - Fu-Tao Hu; Jun-Ming Xu 001 (J. Comb. Optim., 2014)

Generalized measures for fault tolerance of star networks. - Xiang-Jun Li; Jun-Ming Xu 001 (Networks, 2014)

Vulnerability of super edge-connected networks. - Zhen-Mu Hong; Jun-Ming Xu 001 (Theor. Comput. Sci., 2014)

The bondage number of (n-3)-regular graphs of order n. - Fu-Tao Hu; Jun-Ming Xu 001 (Ars Comb., 2015)

On the (l, ω)-domination number of the cube network. - Xin Xie; Jun-Ming Xu 001 (Ars Comb., 2015)

On the p-reinforcement and the complexity. - You Lu 002; Fu-Tao Hu; Jun-Ming Xu 001 (J. Comb. Optim., 2015)

Pebbling numbers of the Cartesian product of cycles and graphs. - Zheng-Jiang Xia; Yong-Liang Pan; Jun-Ming Xu 001 (Australas. J Comb., 2016)

Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs. - Rong-Xia Hao; Zeng-Xian Tian; Jun-Ming Xu 001 (Theor. Comput. Sci., 2016)

Embedded connectivity of recursive networks. - Xiang-Jun Li; Qi-Qi Dong; Zheng Yan 006; Jun-Ming Xu 001 (Theor. Comput. Sci., 2016)

Graham's pebbling conjecture on the middle graphs of even cycles. - Zheng-Jiang Xia; Yong-Liang Pan; Jun-Ming Xu 001; Xi-Ming Cheng (Ars Comb., 2017)

Many-to-many disjoint paths in hypercubes with faulty vertices. - Xiang-Jun Li; Bin Liu 063; Meijie Ma; Jun-Ming Xu 001 (Discret. Appl. Math., 2017)

On Seymour's Second Neighborhood conjecture of m-free digraphs. - Hao Liang; Jun-Ming Xu 001 (Discret. Math., 2017)

Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs. - Mei-Mei Gu; Rong-Xia Hao; Jun-Ming Xu 001; Yan-Quan Feng (Theor. Comput. Sci., 2017)

On fault tolerance of (n, k)-star networks. - Xiang-Jun Li; Yong-Ni Guan; Zheng Yan 006; Jun-Ming Xu 001 (Theor. Comput. Sci., 2017)

The vulnerability of the diameter of the enhanced hypercubes. - Meijie Ma; Douglas B. West; Jun-Ming Xu 001 (Theor. Comput. Sci., 2017)

Generalized measures of fault tolerance for bubble sort networks. - Xiang-Jun Li; Xue-Qian Zeng; Jun-Ming Xu 001 (Appl. Math. Comput., 2019)

On conditional fault tolerance of hierarchical cubic networks. - Xiang-Jun Li; Min Liu; Zheng Yan 006; Jun-Ming Xu 001 (Theor. Comput. Sci., 2019)

Note on reliability evaluation of arrangement graphs. - Xiang-Jun Li; Xue-Qian Zeng; Jun-Ming Xu 001 (Appl. Math. Comput., 2022)