Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun-Ming Xu 0001
Junming Xu 0001
Person information
- affiliation: University of Science and Technology of China, School of Mathematical Sciences, Hefei, China
Other persons with the same name
- Jun-Ming Xu (aka: Junming Xu) — disambiguation page
- Jun-Ming Xu 0002 — University of Wisconsin-Madison, Department of Computer Sciences, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j109]Xiang-Jun Li
, Xue-Qian Zeng, Jun-Ming Xu:
Note on reliability evaluation of arrangement graphs. Appl. Math. Comput. 418: 126845 (2022)- 2019
- [j108]Xiang-Jun Li, Xue-Qian Zeng, Jun-Ming Xu:
Generalized measures of fault tolerance for bubble sort networks. Appl. Math. Comput. 363 (2019) - [j107]Xiang-Jun Li, Min Liu, Zheng Yan, Jun-Ming Xu:
On conditional fault tolerance of hierarchical cubic networks. Theor. Comput. Sci. 761: 1-6 (2019) - 2017
- [j106]Zheng-Jiang Xia, Yong-Liang Pan, Jun-Ming Xu, Xi-Ming Cheng:
Graham's pebbling conjecture on the middle graphs of even cycles. Ars Comb. 132: 285-294 (2017) - [j105]Xiang-Jun Li, Bin Liu, Meijie Ma, Jun-Ming Xu:
Many-to-many disjoint paths in hypercubes with faulty vertices. Discret. Appl. Math. 217: 229-242 (2017) - [j104]Hao Liang, Jun-Ming Xu:
On Seymour's Second Neighborhood conjecture of m-free digraphs. Discret. Math. 340(8): 1944-1949 (2017) - [j103]Mei-Mei Gu, Rong-Xia Hao, Jun-Ming Xu, Yan-Quan Feng:
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs. Theor. Comput. Sci. 690: 59-72 (2017) - [j102]Meijie Ma, Douglas B. West, Jun-Ming Xu:
The vulnerability of the diameter of the enhanced hypercubes. Theor. Comput. Sci. 694: 60-65 (2017) - [j101]Xiang-Jun Li, Yong-Ni Guan, Zheng Yan, Jun-Ming Xu:
On fault tolerance of (n, k)-star networks. Theor. Comput. Sci. 704: 82-86 (2017) - 2016
- [j100]Zheng-Jiang Xia, Yong-Liang Pan, Jun-Ming Xu:
Pebbling numbers of the Cartesian product of cycles and graphs. Australas. J Comb. 65: 124-136 (2016) - [j99]Rong-Xia Hao, Zeng-Xian Tian, Jun-Ming Xu:
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs. Theor. Comput. Sci. 627: 36-53 (2016) - [j98]Xiang-Jun Li, Qi-Qi Dong, Zheng Yan, Jun-Ming Xu:
Embedded connectivity of recursive networks. Theor. Comput. Sci. 653: 79-86 (2016) - 2015
- [j97]Fu-Tao Hu, Jun-Ming Xu:
The bondage number of (n-3)-regular graphs of order n. Ars Comb. 120: 275-281 (2015) - [j96]Xin Xie, Jun-Ming Xu:
On the (l, ω)-domination number of the cube network. Ars Comb. 123: 185-194 (2015) - [j95]You Lu, Fu-Tao Hu, Jun-Ming Xu:
On the p-reinforcement and the complexity. J. Comb. Optim. 29(2): 389-405 (2015) - 2014
- [j94]Fu-Tao Hu, Jun-Ming Xu:
Roman bondage numbers of some graphs. Australas. J Comb. 58: 106-118 (2014) - [j93]Xiang-Jun Li, Jun-Ming Xu:
Fault-tolerance of (n, k)-star networks. Appl. Math. Comput. 248: 525-530 (2014) - [j92]You Lu, Jun-Ming Xu:
Trees with maximum p-reinforcement number. Discret. Appl. Math. 175: 43-54 (2014) - [j91]You Lu, Jun-Ming Xu:
The p-domination number of complete multipartite graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - [j90]Fu-Tao Hu, Jun-Ming Xu:
Total and paired domination numbers of toroidal meshes. J. Comb. Optim. 27(2): 369-378 (2014) - [j89]Xiang-Jun Li, Jun-Ming Xu:
Generalized measures for fault tolerance of star networks. Networks 63(3): 225-230 (2014) - [j88]Zhen-Mu Hong, Jun-Ming Xu:
Vulnerability of super edge-connected networks. Theor. Comput. Sci. 520: 75-86 (2014) - 2013
- [j87]Chao Yang, Jun-Ming Xu:
Connectivity of lexicographic product and direct product of graphs. Ars Comb. 111: 3-12 (2013) - [j86]Yongchang Cao, Jia Huang, Jun-Ming Xu:
The Bondage Number of Graphs with Crossing Number Less than Four. Ars Comb. 112: 493-502 (2013) - [j85]A. Bahremandpour, Fu-Tao Hu, Seyed Mahmoud Sheikholeslami, Jun-Ming Xu:
On the Roman bondage Number of a Graph. Discret. Math. Algorithms Appl. 5(1) (2013) - [j84]Xiang-Jun Li, Jun-Ming Xu:
The Signed Edge-Domatic Number of a Graph. Graphs Comb. 29(6): 1881-1890 (2013) - [j83]Hao Liang, Jun-Ming Xu:
Minimum feedback arc set of m-free digraphs. Inf. Process. Lett. 113(8): 260-264 (2013) - [j82]Xiang-Jun Li, Jun-Ming Xu:
Generalized measures of fault tolerance in exchanged hypercubes. Inf. Process. Lett. 113(14-16): 533-537 (2013) - [j81]Xiang-Jun Li, Jun-Ming Xu:
Edge-fault tolerance of hypercube-like networks. Inf. Process. Lett. 113(19-21): 760-763 (2013) - [j80]Shuming Zhou, Jun-Ming Xu:
Fault diagnosability of arrangement graphs. Inf. Sci. 246: 177-190 (2013) - 2012
- [j79]Xirong Xu, Jian Wang, Jun-Ming Xu, Yongchang Cao:
Feedback numbers of Kautz undirected graphs. Australas. J Comb. 52: 3-10 (2012) - [j78]Fu-Tao Hu, You Lu, Jun-Ming Xu:
The total bondage number of grid graphs. Discret. Appl. Math. 160(16-17): 2408-2418 (2012) - [j77]Shuming Zhou, Limei Lin, Jun-Ming Xu:
Conditional fault diagnosis of hierarchical hypercubes. Int. J. Comput. Math. 89(16): 2152-2164 (2012) - [j76]Shuming Zhou, Lanxiang Chen, Jun-Ming Xu:
Conditional Fault Diagnosability of Dual-Cubes. Int. J. Found. Comput. Sci. 23(8): 1729-1748 (2012) - [j75]Jian Wang, Xirong Xu, Dejun Zhu, Liqing Gao, Jun-Ming Xu:
On the bounds of feedback numbers of (n, k)-star graphs. Inf. Process. Lett. 112(12): 473-478 (2012) - [j74]Fu-Tao Hu, Jun-Ming Xu:
On the complexity of the bondage and reinforcement problems. J. Complex. 28(2): 192-201 (2012) - 2011
- [j73]Meijie Ma, Jun-Ming Xu, Qiang Zhu:
The Menger number of the Cartesian product of graphs. Appl. Math. Lett. 24(5): 627-629 (2011) - [j72]Xiangfeng Pan, Meijie Ma, Jun-Ming Xu:
Highly Fault-Tolerant Routings in Some Cartesian Product Digraphs. Ars Comb. 98: 461-470 (2011) - [j71]You Lu, Jun-Ming Xu:
The p-Bondage Number of Trees. Graphs Comb. 27(1): 129-141 (2011) - [j70]Zheng-Zhong Du, Jun-Ming Xu:
A note on cycle embedding in hypercubes with faulty vertices. Inf. Process. Lett. 111(12): 557-560 (2011) - [j69]Shuming Zhou, Jun-Ming Xu:
Conditional fault tolerance of arrangement graphs. Inf. Process. Lett. 111(21-22): 1037-1043 (2011) - [j68]Xirong Xu, Wenhua Zhai, Jun-Ming Xu, Aihua Deng, Yuansheng Yang:
Fault-tolerant edge-pancyclicity of locally twisted cubes. Inf. Sci. 181(11): 2268-2277 (2011) - [j67]You Lu, Jun-Ming Xu:
Panconnectivity of Cartesian product graphs. J. Supercomput. 56(2): 182-189 (2011) - 2010
- [j66]You Lu, Jun-Ming Xu:
Bipanconnectivity of Cartesian product networks. Australas. J Comb. 46: 297-306 (2010) - [j65]Jia Huang, Jun-Ming Xu:
Domination and Total Domination Contraction Numbers of Graphs. Ars Comb. 94 (2010) - [j64]Jun-Ming Xu, Jian-Wei Wang, Weiwei Wang:
On Super and Restricted Connectivity of Some Interconnection Networks. Ars Comb. 94 (2010) - [j63]Meijie Ma, Jun-Ming Xu:
Algebraic Properties and Panconnectivity of Folded Hypercubes. Ars Comb. 95 (2010) - [j62]Jun-Ming Xu, Chao Yang:
Connectivity and super-connectivity of Cartesian product graphs. Ars Comb. 95 (2010) - [j61]Xirong Xu, Yongchang Cao, Jun-Ming Xu, Yezhou Wu:
Feedback numbers of de Bruijn digraphs. Comput. Math. Appl. 59(2): 716-723 (2010) - [j60]Fu-Tao Hu, Jian-Wei Wang, Jun-Ming Xu:
A new class of transitive graphs. Discret. Math. 310(4): 877-886 (2010) - [j59]Xinmin Hou, You Lu, Jun-Ming Xu:
On the (2, 2)-domination number of trees. Discuss. Math. Graph Theory 30(2): 185-199 (2010) - [j58]Xinmin Hou, Ning Li, You Lu, Jun-Ming Xu:
A characterization of (γt, γ2)-trees. Discuss. Math. Graph Theory 30(3): 425-435 (2010) - 2009
- [j57]Fang Tian, Jun-Ming Xu:
A note on distance domination numbers of graphs. Australas. J Comb. 43: 181-190 (2009) - [j56]Xirong Xu, Jun-Ming Xu, Min Lu, Baosheng Zhang, Nan Cao:
On (a, d)-Antimagic Labelings of Generalized Petersen Graphs. Ars Comb. 90 (2009) - [j55]Jun Yan, Jun-Ming Xu, Chao Yang:
Forwarding index of cube-connected cycles. Discret. Appl. Math. 157(1): 1-7 (2009) - [j54]Fang Tian, Jun-Ming Xu:
Average distances and distance domination numbers. Discret. Appl. Math. 157(5): 1113-1127 (2009) - [j53]Jia Huang, Jian-Wei Wang, Jun-Ming Xu:
Reinforcement numbers of digraphs. Discret. Appl. Math. 157(8): 1938-1946 (2009) - [j52]You Lu, Jun-Ming Xu, Xinmin Hou:
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs. Discret. Appl. Math. 157(15): 3249-3257 (2009) - [j51]He-Xi Ye, Chao Yang, Jun-Ming Xu:
Diameter vulnerability of graphs by edge deletion. Discret. Math. 309(4): 1001-1006 (2009) - [j50]Meijie Ma, Xuegong Tan, Jun-Ming Xu, Guizhen Liu:
A note on "The super connectivity of augmented cubes". Inf. Process. Lett. 109(12): 592-593 (2009) - [j49]Hai-Liang Wang, Jian-Wei Wang, Jun-Ming Xu:
Edge-fault-tolerant bipanconnectivity of hypercubes. Inf. Sci. 179(4): 404-409 (2009) - [j48]Xinmin Hou, Jun-Ming Xu, Min Xu:
The forwarding indices of wrapped butterfly networks. Networks 53(4): 329-333 (2009) - [j47]Zi-Long Liu, Fang Tian, Jun-Ming Xu:
Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs. Theor. Comput. Sci. 410(38-40): 3804-3813 (2009) - 2008
- [j46]Fang Tian, Jun-Ming Xu:
Distance domination-critical graphs. Appl. Math. Lett. 21(4): 416-420 (2008) - [j45]Jun-Ming Xu, Min Lu:
Restricted Edge-Connectivity of de Bruijn Digraphs. Ars Comb. 87 (2008) - [j44]Meijie Ma, Jun-Ming Xu:
Weakly Edge-Pancyclicity of Locally Twisted Cubes. Ars Comb. 89 (2008) - [j43]Jia Huang, Jun-Ming Xu:
The bondage numbers and efficient dominations of vertex-transitive graphs. Discret. Math. 308(4): 571-582 (2008) - [j42]Meijie Ma, Guizhen Liu, Jun-Ming Xu:
The super connectivity of augmented cubes. Inf. Process. Lett. 106(2): 59-63 (2008) - [j41]Chao Yang, Jun-Ming Xu:
Reliability of interconnection networks modeled by Cartesian product digraphs. Networks 52(4): 202-205 (2008) - [j40]Meijie Ma, Guizhen Liu, Jun-Ming Xu:
Fault-tolerant embedding of paths in crossed cubes. Theor. Comput. Sci. 407(1-3): 110-116 (2008) - 2007
- [j39]Min Xu, Xiao-Dong Hu, Jun-Ming Xu:
Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes. Appl. Math. Comput. 189(2): 1393-1401 (2007) - [j38]Jun-Ming Xu, Min Lu, Ying-Mei Fan:
The Restricted Edge-Connectivity of de Bruijn Undirected Graphs. Ars Comb. 83 (2007) - [j37]Jun-Ming Xu, Tao Zhou, Ye Du, Jun Yan:
A New Upper Bound On Forwarding Index of Graphs. Ars Comb. 83 (2007) - [j36]Fang Tian, Jun-Ming Xu:
On Distance Connected Domination Numbers of Graphs. Ars Comb. 84 (2007) - [j35]Jia Huang, Jun-Ming Xu:
The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs. Comput. Math. Appl. 53(8): 1206-1213 (2007) - [j34]Jun-Ming Xu, Yezhou Wu, Jia Huang, Chao Yang:
Feedback numbers of Kautz digraphs. Discret. Math. 307(13): 1589-1599 (2007) - [j33]Jia Huang, Jun-Ming Xu:
The bondage numbers of graphs with small crossing numbers. Discret. Math. 307(15): 1881-1897 (2007) - [j32]Min Xu, Jun-Ming Xu:
The forwarding indices of augmented cubes. Inf. Process. Lett. 101(5): 185-189 (2007) - [j31]Jun-Ming Xu, Chao Yang:
Fault diameter of product graphs. Inf. Process. Lett. 102(6): 226-228 (2007) - [j30]Weiwei Wang, Meijie Ma, Jun-Ming Xu:
Fault-tolerant pancyclicity of augmented cubes. Inf. Process. Lett. 103(2): 52-56 (2007) - [j29]Jun-Ming Xu, Qiang Zhu, Min Xu:
Fault-tolerant analysis of a class of networks. Inf. Process. Lett. 103(6): 222-226 (2007) - [j28]Qiang Zhu, Jun-Ming Xu, Xinmin Hou, Min Xu:
On reliability of the folded hypercubes. Inf. Sci. 177(8): 1782-1788 (2007) - [j27]Min Lü, Guo-Liang Chen, Jun-Ming Xu:
On super edge-connectivity of Cartesian product graphs. Networks 49(2): 152-157 (2007) - [j26]Meijie Ma, Guizhen Liu, Jun-Ming Xu:
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes. Parallel Comput. 33(1): 36-42 (2007) - 2006
- [j25]Jun-Ming Xu, Meijie Ma, Zheng-Zhong Du:
Edge-fault-tolerant properties of hypercubes and folded hypercubes. Australas. J Comb. 35: 7-16 (2006) - [j24]Qiang Zhu, Jun-Ming Xu, Min Lv:
Edge fault tolerance analysis of a class of interconnection networks. Appl. Math. Comput. 172(1): 111-121 (2006) - [j23]Jun-Ming Xu, Meijie Ma:
Cycles in folded hypercubes. Appl. Math. Lett. 19(2): 140-145 (2006) - [j22]Meijie Ma, Jun-Ming Xu:
Panconnectivity of locally twisted cubes. Appl. Math. Lett. 19(7): 673-677 (2006) - [j21]Ying-Mei Fan, Jun-Ming Xu, Min Lu:
The Restricted Edge-Connectivity of Kautz Undirected Graphs. Ars Comb. 81 (2006) - [j20]Jia Huang, Jun-Ming Xu:
The bondage numbers of extended de Bruijn and Kautz digraphs. Comput. Math. Appl. 51(6-7): 1137-1147 (2006) - [j19]Jun-Ming Xu, Chao Yang:
Connectivity of Cartesian product graphs. Discret. Math. 306(1): 159-165 (2006) - [j18]Jun-Ming Xu, Fang Tian, Jia Huang:
Distance irredundance and connected domination numbers of a graph. Discret. Math. 306(22): 2943-2953 (2006) - [j17]Jun-Ming Xu, Meijie Ma, Min Lü:
Paths in Möbius cubes and crossed cubes. Inf. Process. Lett. 97(3): 94-97 (2006) - 2005
- [j16]Xinmin Hou, Min Xu, Jun-Ming Xu:
Forwarding indices of folded n-cubes. Discret. Appl. Math. 145(3): 490-492 (2005) - [j15]Min Xu, Junming Xu, Xinmin Hou:
Fault diameter of Cartesian product graphs. Inf. Process. Lett. 93(5): 245-248 (2005) - [j14]Jun-Ming Xu, Min Lü, Meijie Ma, Angelika Hellwig:
Super connectivity of line graphs. Inf. Process. Lett. 94(4): 191-195 (2005) - [j13]Jun-Ming Xu, Min Xu, Qiang Zhu:
The super connectivity of shuffle-cubes. Inf. Process. Lett. 96(4): 123-127 (2005) - [j12]Min Xu, Jun-Ming Xu:
Edge-pancyclicity of Möbius cubes. Inf. Process. Lett. 96(4): 136-140 (2005) - [j11]Jun-Ming Xu, Zheng-Zhong Du, Min Xu:
Edge-fault-tolerant edge-bipancyclicity of hypercubes. Inf. Process. Lett. 96(4): 146-150 (2005) - [j10]Jun-Ming Xu, Zhi-Guo Deng:
Wide Diameter of Möbius Cubes. J. Interconnect. Networks 6(1): 51-62 (2005) - 2004
- [j9]Jun-Ming Xu, Qi Liu:
2-restricted edge connectivity of vertex-transitive graphs. Australas. J Comb. 30: 41-50 (2004) - [j8]Jun-Ming Xu:
Wide Diameters of Cartesian Product Graphs and Digraphs. J. Comb. Optim. 8(2): 171-181 (2004) - [j7]Min Xu, Xinmin Hou, Jun-Ming Xu:
The proof of a conjecture of Bouabdallah and Sotteau. Networks 44(4): 292-296 (2004) - 2002
- [j6]Jun-Ming Xu, Ke-Li Xu:
On restricted edge-connectivity of graphs. Discret. Math. 243(1-3): 291-298 (2002) - 1996
- [j5]Qiao Li, Dominique Sotteau, Junming Xu:
2-diameter of de Bruijn graphs. Networks 28(1): 7-14 (1996) - 1994
- [j4]Jun-Ming Xu:
A sufficient condition for equality of arc-connectivity and minimum degree of a diagraph. Discret. Math. 133(1-3): 315-318 (1994) - 1993
- [j3]Q. Li, Jun-Ming Xu, Z. L. Zhang:
The Infinite Families of Optimal Double Loop Networks. Discret. Appl. Math. 46(2): 179-183 (1993) - [j2]Qiao Li, Zhongliang Zhang, Junming Xu:
A very short proof of a conjecture concerning set-to-set broadcasting. Networks 23(4): 449-450 (1993) - 1990
- [j1]Ding-Zhu Du, D. Frank Hsu, Qiao Li, Junming Xu:
A combinatorial problem related to distributed loop networks. Networks 20(2): 173-180 (1990)
Informal and Other Publications
- 2016
- [i4]Meijie Ma, Douglas B. West, Jun-Ming Xu:
The vulnerability of the diameter of enhanced hypercubes. CoRR abs/1604.02906 (2016) - 2012
- [i3]Jun-Ming Xu, Min Xu:
The Forwarding Indices of Graphs -- a Survey. CoRR abs/1204.2604 (2012) - [i2]Shuming Zhou, Jian Wang, Xirong Xu, Jun-Ming Xu:
Conditional Fault Diagnosis of Bubble Sort Graphs under the PMC Model. CoRR abs/1204.4250 (2012) - 2011
- [i1]Fu-Tao Hu, Jun-Ming Xu:
Complexity of Bondage and Reinforcement. CoRR abs/1109.1657 (2011)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
