14 citations · 27 across the 19 of their papers we have counts for
18 papers
Constructions of almost controllable graphs determined by their generalized spectra
Wei Wang, Manjin Shi, Fenjin Liu
Identifying and constructing graphs that are determined by their generalized spectrum (DGS) is a significant and challenging problem in spectral graph theory. Recently, a simple cr…
On spanning trees whose degrees are congruent to one modulo
Zhidan Yan, Wei Wang
An -congruent spanning tree of a nontrivial connected graph is a spanning tree in which every vertex has degree congruent to one modulo . This notion provides a common…
Proof of a conjecture on the determinant of walk matrix of rooted product with a path
Wei Wang, Zhidan Yan, Lihuan Mao
The walk matrix of an -vertex graph with adjacency matrix , denoted by , is , where is the all-ones vector. Let be the root…
The list-coloring function of signed graphs
Sumin Huang, Jianguo Qian, Wei Wang
It is known that, for any -list assignment of a graph , the number of -list colorings of is at least the number of the proper -colorings of when $k>(m-1)/\l…
The smallest pair of cospectral cubic graphs with different chromatic indexes
Zhidan Yan, Wei Wang
Using an exhaustive search on cubic graphs of order 16, we find a unique cospectral pair with different chromatic indexes. This example indicates that the chromatic index of a regu…
Generalized spectral characterization of mixed graphs
Wei Wang, Lihong Qiu, Jianguo Qian
A mixed graph is a graph obtained from a simple undirected graph by orientating a subset of edges. is self-converse if it is isomorphic to the graph obtained from by re…