On Interdependent Failure Resilient Multi-path Routing in Smart Grid Communication Network. - Zishen Yang; Donghyun Kim 001; Wei Wang 195 (COCOA (2), 2017)

Complexity and algorithms for the connected vertex cover problem in 4-regular graphs. - Yuchao Li; Zishen Yang; Wei Wang 195 (Appl. Math. Comput., 2017)

A Note on Non-ℝ-Cospectral Graphs. - Fenjin Liu; Wei Wang 195 (Electron. J. Comb., 2017)

A simple arithmetic criterion for graphs being determined by their generalized spectra. - Wei Wang 195 (J. Comb. Theory B, 2017)

Algorithm and complexity of the two disjoint connected dominating sets problem on trees. - Xianliang Liu; Zishen Yang; Wei Wang 195 (Appl. Math. Comput., 2018)

On the Generalized Spectral Characterizations of Eulerian Graphs. - Lihong Qiu; Yizhe Ji; Wei Wang 195 (Electron. J. Comb., 2019)

Spectral characterization of the complete graph removing a path of small length. - Lihuan Mao; Sebastian M. Cioaba; Wei Wang 195 (Discret. Appl. Math., 2019)

New families of graphs determined by their generalized spectrum. - Fenjin Liu; Johannes Siemons; Wei Wang 195 (Discret. Math., 2019)

A new arithmetic criterion for graphs being determined by their generalized Q-spectrum. - Lihong Qiu; Yizhe Ji; Wei Wang 195 (Discret. Math., 2019)

Some results for the two disjoint connected dominating sets problem. - Xianliang Liu; Zishen Yang; Wei Wang 195 (Discret. Math. Algorithms Appl., 2019)

The connected vertex cover problem in k-regular graphs. - Yuchao Li; Wei Wang 195; Zishen Yang (J. Comb. Optim., 2019)

Generalized Spectral Characterization of Mixed Graphs. - Wei Wang 195; Lihong Qiu; Jianguo Qian; Wei Wang 052 (Electron. J. Comb., 2020)

Constructing cospectral bipartite graphs. - Yizhe Ji; Shicai Gong; Wei Wang 195 (Discret. Math., 2020)

Generalized spectral characterizations of almost controllable graphs. - Wei Wang 052; Fenjin Liu; Wei Wang 195 (Eur. J. Comb., 2021)

The t-latency bounded strong target set selection problem in some kinds of special family of graphs. - Xianliang Liu; Zishen Yang; Wei Wang 195 (J. Comb. Optim., 2021)

On multi-path routing for reliable communications in failure interdependent complex networks. - Zishen Yang; Wei Wang 195; Donghyun Kim 001 (J. Comb. Optim., 2021)

A new criterion for almost controllable graphs being determined by their generalized spectra. - Lihong Qiu; Wei Wang 052; Wei Wang 195; Hao Zhang (Discret. Math., 2022)

Spectral characterizations of tournaments. - Wei Wang 052; Wei Wang 195; Lihong Qiu (Discret. Math., 2022)

Constructing cospectral graphs via regular rational orthogonal matrices with level two. - Lihuan Mao; Wei Wang 195; Fenjin Liu; Lihong Qiu (Discret. Math., 2023)

Smith Normal Form and the generalized spectral characterization of graphs. - Lihong Qiu; Wei Wang 052; Wei Wang 195; Hao Zhang (Discret. Math., 2023)

An improved condition for a graph to be determined by its generalized spectrum. - Wei Wang 052; Wei Wang 195; Fuhai Zhu (Eur. J. Comb., 2023)