2 citations · 3 across the 6 of their papers we have counts for
6 papers · 1 filter
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…
Signed graphs with exactly two main eigenvalues: The unicyclic case
Zenan Du, Fenjin Liu, Hechao Liu +2
An eigenvalue of a signed graph of order is called a main eigenvalue if its eigenspace is not orthogonal to the all-ones vector . Characterizing signed graphs with e…
Generalized spectral characterizations of almost controllable graphs
Wei Wang, Fenjin Liu
Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very h…
Unlocking the walk matrix of a graph
Fenjin Liu, Johannes Siemons
Let be a graph with vertex set and adjacency matrix For a subset of let $\e=(x_{1},\,\dots,\,x_{n})^{\tt T}$ be the characteristic vector…
New families of graphs determined by their generalized spectrum
Fenjin Liu, Johannes Siemons, Wei Wang
We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a g…
A note on graphs with exactly two main eigenvalues
Sakander Hayat, Jack H. Koolen, Fenjin Liu +1
In this note, we consider connected graphs with exactly two main eigenvalues. We will give several constructions for them, and as a consequence we show a family of those graphs wit…