Junming Xu

activity

20092017

most citedComplexity of Bondage and Reinforcement

6 citations · 31 across the 37 of their papers we have counts for

collaborators

Showing 2012 · math.COShow all

18 papers · 2 filters

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…

math.CO2012

Generalized Measures of Fault Tolerance in Exchanged Hypercubes

Xiang-Jun Li, Jun-Ming Xu

The exchanged hypercube $E H (s, t)$ , proposed by Loh {\it et al.} [The exchanged hypercube, IEEE Transactions on Parallel and Distributed Systems 16 (9) (2005) 866-874], is obtained…

math.CO2012

The p-Domination Number of Complete Multipartite Graphs

You Lu, Jun-Ming Xu

Let $G = (V, E)$ be a graph and $p$ a positive integer. A subset $S \subseteq V$ is called a $p$ -dominating set of $G$ if every vertex not in $S$ has at least $p$ neighbors in $S$ . The…