Jun‐Ming Xu

ORCID: 0000-0003-0515-9304
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Interconnection Networks and Systems
  • Advanced Graph Theory Research
  • Graph theory and applications
  • Graph Labeling and Dimension Problems
  • Advanced Optical Network Technologies
  • Distributed systems and fault tolerance
  • Complexity and Algorithms in Graphs
  • Limits and Structures in Graph Theory
  • graph theory and CDMA systems
  • Advancements in Battery Materials
  • Embedded Systems Design Techniques
  • VLSI and FPGA Design Techniques
  • Cooperative Communication and Network Coding
  • Software-Defined Networks and 5G
  • Graphene research and applications
  • Parallel Computing and Optimization Techniques
  • Graph Theory and Algorithms
  • Supercapacitor Materials and Fabrication
  • Optimization and Search Problems
  • VLSI and Analog Circuit Testing
  • Radiation Effects in Electronics
  • Carbon and Quantum Dots Applications
  • Finite Group Theory Research
  • Advanced Battery Technologies Research
  • Coding theory and cryptography

Hefei University of Technology
2024

Southwest Jiaotong University
2023

University of Science and Technology of China
2012-2021

Bozhou People's Hospital
2020

Naval Aeronautical and Astronautical University
2010-2014

Chinese Academy of Sciences
2012

Hefei University
2009

Zhejiang Normal University
2008

Beijing Normal University
2008

Hangzhou Dianzi University
2008

10.1016/j.ins.2006.11.003 article EN Information Sciences 2006-12-09

10.1007/s11464-009-0017-5 article EN Frontiers of Mathematics in China 2009-03-11

10.1016/j.aml.2005.04.002 article EN publisher-specific-oa Applied Mathematics Letters 2005-07-23

10.1016/j.ipl.2013.04.007 article EN Information Processing Letters 2013-04-19

10.1016/s0012-365x(01)00232-1 article EN publisher-specific-oa Discrete Mathematics 2002-01-01

10.1016/j.disc.2005.11.010 article EN publisher-specific-oa Discrete Mathematics 2006-01-01

10.1016/j.ipl.2007.10.005 article EN Information Processing Letters 2007-11-09

10.1016/j.amc.2006.12.036 article EN Applied Mathematics and Computation 2006-12-21

10.1016/j.ins.2013.04.038 article EN Information Sciences 2013-05-31

This article shows that, for any integers n and k with , at least vertices or edges have to be removed from an n-dimensional star graph make it disconnected no of degree less than k. The result gives affirmative answer the conjecture proposed by Wan Zhang (Appl Math Lett 22 (2009), 264-267).Copyright © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 63(3), 225–230

10.1002/net.21539 article EN Networks 2014-01-27

10.1016/j.aml.2005.08.021 article EN Applied Mathematics Letters 2005-10-26

10.1016/j.jco.2011.11.001 article EN publisher-specific-oa Journal of Complexity 2011-11-17

10.1016/j.amc.2014.10.006 article EN Applied Mathematics and Computation 2014-10-28

The domination number of a graph is the smallest vertices which dominate all remaining by edges . bondage nonempty whose removal from results in with greater than concept was formally introduced Fink et al. 1990. Since then, this topic has received considerable research attention and made some progress, variations, generalizations. This paper gives survey on number, including known results, conjectures, problems, comments, also selectively summarizes other types numbers.

10.1155/2013/595210 article EN International Journal of Combinatorics 2013-05-13

10.1016/j.ipl.2013.07.010 article EN Information Processing Letters 2013-07-16

10.1016/j.ipl.2005.06.006 article EN Information Processing Letters 2005-08-26

10.1016/j.ipl.2004.11.005 article EN Information Processing Letters 2004-12-24
Coming Soon ...