# Weihua Yang

According to our database

Collaborative distances:

^{1}, Weihua Yang authored at least 56 papers between 2009 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks.

Parallel Processing Letters, 2018

A Remark on Rainbow 6-Cycles in Hypercubes.

Parallel Processing Letters, 2018

On 3-Regular Subgraphs in Cartesian Product of Paths.

Journal of Interconnection Networks, 2018

Component Edge Connectivity of Hypercubes.

Int. J. Found. Comput. Sci., 2018

A conditional edge connectivity of double-orbit networks.

Future Generation Comp. Syst., 2018

Making a dominating set of a graph connected.

Discussiones Mathematicae Graph Theory, 2018

On the spanning connectivity of tournaments.

Discrete Applied Mathematics, 2018

A kind of conditional connectivity of transposition networks generated by k-trees.

Discrete Applied Mathematics, 2018

Number of proper paths in edge-colored hypercubes.

Applied Mathematics and Computation, 2018

2017

On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks.

Theor. Comput. Sci., 2017

Strong Menger connectivity with conditional faults of folded hypercubes.

Inf. Process. Lett., 2017

Hamiltonian paths in spanning subgraphs of line graphs.

Discrete Mathematics, 2017

Supereulerian graphs and Chvatal-Erdos type conditions.

Ars Comb., 2017

Edge disjoint paths in hypercubes and folded hypercubes with conditional faults.

Applied Mathematics and Computation, 2017

The generalized 3-connectivity of graph products.

Applied Mathematics and Computation, 2017

2016

Component connectivity of hypercubes.

Theor. Comput. Sci., 2016

Int. J. Comput. Math., 2016

A Note on Edge-Disjoint Hamilton Cycles in Line Graphs.

Graphs and Combinatorics, 2016

Hamiltonian cycles in spanning subgraphs of line graphs.

Discrete Applied Mathematics, 2016

On total domination number of Cartesian product of directed cycles.

Ars Comb., 2016

2015

Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees.

Int. J. Comput. Math., 2015

On cyclic edge connectivity of regular graphs with two orbits.

Ars Comb., 2015

A note on the graphs with given small matching number.

Ars Comb., 2015

λ'-optimal regular graphs with two orbits.

Ars Comb., 2015

A kind of conditional vertex connectivity of recursive circulants.

Ars Comb., 2015

2014

Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity.

IEEE Trans. Computers, 2014

Reliability analysis of bijective connection networks in terms of the extra edge-connectivity.

Inf. Sci., 2014

On reliability of the folded hypercubes in terms of the extra edge-connectivity.

Inf. Sci., 2014

Collapsible Graphs and Hamiltonicity of Line Graphs.

Graphs and Combinatorics, 2014

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree.

Discrete Applied Mathematics, 2014

Strongly self-centered orientation of complete k-partite graphs.

Discrete Applied Mathematics, 2014

Extraconnectivity of Folded Hypercubes.

Ars Comb., 2014

2013

Supereulerian graphs, Hamiltonicity of graphes and several extremal problems in graphs. (Graphes super-eulériens, problèmes hamiltonicité et extrémaux dans les graphes).

PhD thesis, 2013

Bounding the size of the subgraph induced by

*m*m vertices and extra edge-connectivity of hypercubes.
Discrete Applied Mathematics, 2013

Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs.

Appl. Math. Lett., 2013

On the t/k-diagnosability of BC networks.

Applied Mathematics and Computation, 2013

2012

Distance spectral radius of digraphs with given connectivity.

Discrete Mathematics, 2012

Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees.

Discrete Mathematics, 2012

Every 3-connected essentially 10-connected line graph is Hamilton-connected.

Discrete Mathematics, 2012

A note on collapsible graphs and super-Eulerian graphs.

Discrete Mathematics, 2012

Collapsible graphs and Hamiltonian connectedness of line graphs.

Discrete Applied Mathematics, 2012

Hamiltonicity of 3-connected line graphs.

Appl. Math. Lett., 2012

Generalized measures of fault tolerance in hypercube networks.

Appl. Math. Lett., 2012

Super restricted edge connectivity of regular graphs with two orbits.

Applied Mathematics and Computation, 2012

2011

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees.

Inf. Sci., 2011

On super 2-restricted and 3-restricted edge-connected vertex transitive graphs.

Discrete Mathematics, 2011

On the edge-connectivity of graphs with two orbits of the same size.

Discrete Mathematics, 2011

Outerplanarity of line graphs and iterated line graphs.

Appl. Math. Lett., 2011

On a kind of reliability analysis of networks.

Applied Mathematics and Computation, 2011

2010

A kind of conditional fault tolerance of alternating group graphs.

Inf. Process. Lett., 2010

Conditional connectivity of Cayley graphs generated by transposition trees.

Inf. Process. Lett., 2010

A kind of conditional fault tolerance of (n, k)-star graphs.

Inf. Process. Lett., 2010

Extraconnectivity of Cartesian product graphs of paths.

Ars Comb., 2010

Extraconnectivity of hypercubes (II).

Australasian J. Combinatorics, 2010

2009

Embedding connected double-loop networks with even cardinality in books.

Appl. Math. Lett., 2009

Extraconnectivity of hypercubes.

Appl. Math. Lett., 2009