What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Graph theory
His primary areas of investigation include Combinatorics, Discrete mathematics, Hypercube, Graph and Panconnectivity.
His works in Augmented cube, Graph and Degree are all subjects of inquiry into Combinatorics.
All of his Discrete mathematics and Vertex, Pathwidth, 1-planar graph and Indifference graph investigations are sub-components of the entire Discrete mathematics study.
His Hypercube study combines topics from a wide range of disciplines, such as Embedding, Topology, Interconnection and Edge.
His Topology research incorporates elements of Network planning and design and De Bruijn sequence.
In his research, Strongly connected component is intimately related to Cartesian product, which falls under the overarching field of Graph.
His most cited work include:
- Topological Structure and Analysis of Interconnection Networks (489 citations)
- Theory and Application of Graphs (192 citations)
- On reliability of the folded hypercubes (102 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Combinatorics, Discrete mathematics, Graph, Hypercube and Domination analysis.
His Vertex, Connectivity, Vertex, Bondage number and Dominating set investigations are all subjects of Combinatorics research.
Jun-Ming Xu works mostly in the field of Graph, limiting it down to topics relating to Multiprocessing and, in certain cases, Connected component, as a part of the same area of interest.
His studies deal with areas such as Embedding, Panconnectivity, Interconnection and Edge as well as Hypercube.
His study explores the link between Indifference graph and topics such as 1-planar graph that cross with problems in Pathwidth.
His Digraph research includes themes of Simple and De Bruijn sequence.
He most often published in these fields:
- Combinatorics (86.63%)
- Discrete mathematics (62.03%)
- Graph (43.85%)
What were the highlights of his more recent work (between 2013-2019)?
- Combinatorics (86.63%)
- Discrete mathematics (62.03%)
- Graph (43.85%)
In recent papers he was focusing on the following fields of study:
His main research concerns Combinatorics, Discrete mathematics, Graph, Vertex and Hypercube.
His study on Combinatorics is mostly dedicated to connecting different topics, such as Upper and lower bounds.
His Discrete mathematics study is mostly concerned with Cartesian product, Chordal graph, 1-planar graph, Indifference graph and Graph product.
Jun-Ming Xu combines subjects such as Modular decomposition and Pathwidth with his study of Chordal graph.
In his research on the topic of Hypercube, Linear algorithm is strongly related with Disjoint sets.
The Vertex study combines topics in areas such as Digraph and Real number.
Between 2013 and 2019, his most popular works were:
- Fault-tolerance of ( n , k ) -star networks (33 citations)
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs (30 citations)
- Generalized measures for fault tolerance of star networks (28 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Discrete mathematics
- Graph theory
His primary scientific interests are in Combinatorics, Discrete mathematics, Graph, Hypercube and Vertex.
His study looks at the relationship between Combinatorics and fields such as Star network, as well as how they intersect with chemical problems.
His study in Clique-sum, Pathwidth, Modular decomposition, 1-planar graph and Indifference graph is carried out as part of his studies in Discrete mathematics.
His is involved in several facets of Graph study, as is seen by his studies on Dominating set, Vertex and Domination analysis.
His work deals with themes such as Cayley graph and Regular graph, which intersect with Vertex.
The study incorporates disciplines such as Linear algorithm and Integer in addition to Disjoint sets.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
