Jun‐Ming Xu

most citedThe 2-Domination and 2-Bondage Numbers of Grid Graphs

5 citations · 16 across the 21 of their papers we have counts for

collaborators

21 papers

math.CO2013

Generalized Connectivity of Star Graphs

Xiang-Jun Li, Jun-Ming Xu

This paper shows that, for any integers $n$ and $k$ with $0 ⩽ k ⩽ n - 2$ , at least $(k + 1)! (n - k - 1)$ vertices or edges have to be removed from an $n$ -dimensional star gr…

math.CO2013

Vulnerability of super edge-connected graphs

Zhen-Mu Hong, Jun-Ming Xu

A subset $F$ of edges in a connected graph $G$ is a $h$ -extra edge-cut if $G - F$ is disconnected and every component has more than $h$ vertices. The $h$ -extra edge-connectivity $\la…

math.CO2012

Transitivity of Varietal Hypercube Networks

Li Xiao, Jin Cao, Jun-Ming Xu

The varietal hypercube $V Q_{n}$ is a variant of the hypercube $Q_{n}$ and has better properties than $Q_{n}$ with the same number of edges and vertices. This paper proves that $V Q_{n}$ is…

math.CO2012

Edge-Fault Tolerance of Hypercube-like Networks

Xiang-Jun Li, Jun-Ming Xu

This paper considers a kind of generalized measure $λ_{s}^{(h)}$ of fault tolerance in a hypercube-like graph $G_{n}$ which contain several well-known interconnection networks such as…

math.CO2012★ 1 cited

Trees with Maximum p-Reinforcement Number

You Lu, Jun-Ming Xu

Let $G = (V, E)$ be a graph and $p$ a positive integer. The $p$ -domination number $\g_p(G)$ is the minimum cardinality of a set $D \subseteq V$ with $∣ N_{G} (x) \cap D ∣ \geq p$ for all $x\i…

math.CO2012★ 2 cited

Cycles and Paths Embedded in Varietal Hypercubes

Jin Cao, Li Xiao, Jun-Ming Xu

The varietal hypercube $V Q_{n}$ is a variant of the hypercube $Q_{n}$ and has better properties than $Q_{n}$ with the same number of edges and vertices. This paper shows that every edge…