SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Jun-Ming Xu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Meijie Ma, Jun-Ming Xu
Panconnectivity of locally twisted cubes. [Citation Graph (0, 0)][DBLP]
Appl. Math. Lett., 2006, v:19, n:7, pp:673-677 [Journal]
Jun-Ming Xu, Meijie Ma
Cycles in folded hypercubes. [Citation Graph (0, 0)][DBLP]
Appl. Math. Lett., 2006, v:19, n:2, pp:140-145 [Journal]
Xin-Min Hou, Min Xu, Jun-Ming Xu
Forwarding indices of folded n-cubes. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2005, v:145, n:3, pp:490-492 [Journal]
Jun-Ming Xu, Ke-Li Xu
On restricted edge-connectivity of graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2002, v:243, n:1-3, pp:291-298 [Journal]
Jun-Ming Xu, Chao Yang
Connectivity of Cartesian product graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2006, v:306, n:1, pp:159-165 [Journal]
Jun-Ming Xu, Fang Tian, Jia Huang
Distance irredundance and connected domination numbers of a graph. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2006, v:306, n:22, pp:2943-2953 [Journal]
Jia Huang, Jun-Ming Xu
The bondage numbers of graphs with small crossing numbers. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2007, v:307, n:15, pp:1881-1897 [Journal]
Jun-Ming Xu, Ye-Zhou Wu, Jia Huang, Chao Yang
Feedback numbers of Kautz digraphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2007, v:307, n:13, pp:1589-1599 [Journal]
Min Xu, Jun-Ming Xu
The forwarding indices of augmented cubes. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2007, v:101, n:5, pp:185-189 [Journal]
Jun-Ming Xu, Zheng-Zhong Du, Min Xu
Edge-fault-tolerant edge-bipancyclicity of hypercubes. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2005, v:96, n:4, pp:146-150 [Journal]
Jun-Ming Xu, Min Lü, Meijie Ma, Angelika Hellwig
Super connectivity of line graphs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2005, v:94, n:4, pp:191-195 [Journal]
Jun-Ming Xu, Meijie Ma, Min Lü
Paths in Möbius cubes and crossed cubes. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2006, v:97, n:3, pp:94-97 [Journal]
Min Xu, Jun-Ming Xu
Edge-pancyclicity of Möbius cubes. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2005, v:96, n:4, pp:136-140 [Journal]
Min Xu, Jun-Ming Xu, Xin-Min Hou
Fault diameter of Cartesian product graphs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2005, v:93, n:5, pp:245-248 [Journal]
Jun-Ming Xu, Min Xu, Qiang Zhu
The super connectivity of shuffle-cubes. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2005, v:96, n:4, pp:123-127 [Journal]
Jun-Ming Xu, Chao Yang
Fault diameter of product graphs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2007, v:102, n:6, pp:226-228 [Journal]
Wei-Wei Wang, Meijie Ma, Jun-Ming Xu
Fault-tolerant pancyclicity of augmented cubes. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2007, v:103, n:2, pp:52-56 [Journal]
Qiang Zhu, Jun-Ming Xu, Xinmin Hou, Min Xu
On reliability of the folded hypercubes. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 2007, v:177, n:8, pp:1782-1788 [Journal]
Jun-Ming Xu
Wide Diameters of Cartesian Product Graphs and Digraphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Optim., 2004, v:8, n:2, pp:171-181 [Journal]
Jun-Ming Xu, Zhi-Guo Deng
Wide Diameter of Möbius Cubes. [Citation Graph (0, 0)][DBLP]
Journal of Interconnection Networks, 2005, v:6, n:1, pp:51-62 [Journal]
Min Xu, Xin-Min Hou, Jun-Ming Xu
The proof of a conjecture of Bouabdallah and Sotteau. [Citation Graph (0, 0)][DBLP]
Networks, 2004, v:44, n:4, pp:292-296 [Journal]
Meijie Ma, Guizhen Liu, Jun-Ming Xu
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes. [Citation Graph (0, 0)][DBLP]
Parallel Computing, 2007, v:33, n:1, pp:36-42 [Journal]
Qiang Zhu, Jun-Ming Xu, Min Lv
Edge fault tolerance analysis of a class of interconnection networks. [Citation Graph (0, 0)][DBLP]
Applied Mathematics and Computation, 2006, v:172, n:1, pp:111-121 [Journal]
Zhi-Hua Zhou, Jun-Ming Xu
On the relation between multi-instance learning and semi-supervised learning. [Citation Graph (0, 0)][DBLP]
ICML, 2007, pp:1167-1174 [Conf]
Jun-Ming Xu
A sufficient condition for equality of arc-connectivity and minimum degree of a diagraph. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1994, v:133, n:1-3, pp:315-318 [Journal]
Jun-Ming Xu, Qiang Zhu, Min Xu
Fault-tolerant analysis of a class of networks. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2007, v:103, n:6, pp:222-226 [Journal]
Distance domination-critical graphs. [Citation Graph (, )][DBLP]
Restricted Edge-Connectivity of de Bruijn Digraphs. [Citation Graph (, )][DBLP]
Weakly Edge-Pancyclicity of Locally Twisted Cubes. [Citation Graph (, )][DBLP]
The Restricted Edge-Connectivity of Kautz Undirected Graphs. [Citation Graph (, )][DBLP]
On Distance Connected Domination Numbers of Graphs. [Citation Graph (, )][DBLP]
The Restricted Edge-Connectivity of de Bruijn Undirected Graphs. [Citation Graph (, )][DBLP]
A New Upper Bound On Forwarding Index of Graphs. [Citation Graph (, )][DBLP]
Forwarding index of cube-connected cycles. [Citation Graph (, )][DBLP]
Average distances and distance domination numbers. [Citation Graph (, )][DBLP]
Reinforcement numbers of digraphs. [Citation Graph (, )][DBLP]
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs. [Citation Graph (, )][DBLP]
The bondage numbers and efficient dominations of vertex-transitive graphs. [Citation Graph (, )][DBLP]
Diameter vulnerability of graphs by edge deletion. [Citation Graph (, )][DBLP]
A new class of transitive graphs. [Citation Graph (, )][DBLP]

Search in 0.049secs, Finished in 0.050secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP