Wei Wang

According to our database1, Wei Wang authored at least 14 papers between 2017 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
On multi-path routing for reliable communications in failure interdependent complex networks.
J. Comb. Optim., 2021

The t-latency bounded strong target set selection problem in some kinds of special family of graphs.
J. Comb. Optim., 2021

2020
Constructing cospectral bipartite graphs.
Discret. Math., 2020

Generalized Spectral Characterization of Mixed Graphs.
Electron. J. Comb., 2020

2019
The connected vertex cover problem in k-regular graphs.
J. Comb. Optim., 2019

Some results for the two disjoint connected dominating sets problem.
Discret. Math. Algorithms Appl., 2019

A new arithmetic criterion for graphs being determined by their generalized Q-spectrum.
Discret. Math., 2019

New families of graphs determined by their generalized spectrum.
Discret. Math., 2019

On the Generalized Spectral Characterizations of Eulerian Graphs.
Electron. J. Comb., 2019

2018
Algorithm and complexity of the two disjoint connected dominating sets problem on trees.
Appl. Math. Comput., 2018

2017
A simple arithmetic criterion for graphs being determined by their generalized spectra.
J. Comb. Theory, Ser. B, 2017

A Note on Non-ℝ-Cospectral Graphs.
Electron. J. Comb., 2017

Complexity and algorithms for the connected vertex cover problem in 4-regular graphs.
Appl. Math. Comput., 2017

On Interdependent Failure Resilient Multi-path Routing in Smart Grid Communication Network.
Proceedings of the Combinatorial Optimization and Applications, 2017


  Loading...