6 citations · 15 across the 12 of their papers we have counts for
12 papers
On the divisibility of H-shape trees and their spectral determination
Zhen Chen, Jianfeng Wang, Maurizio Brunetti +1
A graph is divisible by a graph if the characteristic polynomial of is divisible by that of . In this paper, a necessary and sufficient condition for recursive graph…
Inertia and spectral symmetry of eccentricity matrices of some clique trees
Xiaohong Li, Jianfeng Wang, Maurizio Brunetti
The eccentricity matrix of a connected graph is obtained from the distance matrix of by leaving unchanged the largest nonzero entries in each row and each c…
On distance-balanced generalized Petersen graphs
Gang Ma, Jianfeng Wang, Sandi Klavžar
A connected graph of diameter is -distance-balanced if for every with , where is the…
The strong chromatic index of 1-planar graphs
Yiqiao Wang, Ning Song, Jianfeng Wang +1
The chromatic index of a graph is the smallest for which admits an edge -coloring such that any two adjacent edges have distinct colors. The strong chromatic…
On graphs with exactly one anti-adjacency eigenvalue and beyond
Jianfeng Wang, Xingyu Lei, Mei Lu +2
The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by keeping each row and each column only the largest distances. This matrix can be interpret…
A Hoffman's Theorem: a revisit with new discovery
Jianfeng Wang, Jing Wang, Maurizio Brunetti
In 1972, A. J. Hoffman proved his celebrated theorem concerning the limit points of spectral radii of non-negative symmetric integral matrices less than . In thi…
The Hoffman program of graphs: old and new
Jianfeng Wang, Jing Wang, Maurizio Brunetti
The Hoffman program with respect to any real or complex square matrix associated to a graph stems from A. J. Hoffman's pioneering work on the limit points for the spectral…
On joins of a clique and a co-clique as star complements in regular graphs
Yuhong Yang, Jianfeng Wang, Qiongxiang Huang +1
In this paper we consider -regular graphs that admit the vertex set partition such that one of the induced subgraphs is the join of an -vertex clique and a -vertex co-…
Open problems in the spectral theory of signed graphs
Francesco Belardo, Sebastian M. Cioabă, Jack H. Koolen +1
Signed graphs are graphs whose edges get a sign or (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Re…
Two bosons in a narrowly resonant trap
Bingwei Long, Jianfeng Wang, Songlin Lyu
It is rare for an -wave resonance to remain narrow while approaching threshold as a result of the interaction parameters being fine tuned. Such an interaction is, however, reali…
On a Problem of Harary and Schwenk on Graphs with Distinct Eigenvalues
Xueliang Li, Jianfeng Wang, Qiongxiang Huang
Harary and Schwenk posed the problem forty years ago: Which graphs have distinct adjacency eigenvalues? In this paper, we obtain a necessary and sufficient condition for an Hermiti…
Randić energy and Randić eigenvalues
Xueliang Li, Jianfeng Wang
Let be a graph of order , and the degree of a vertex of . The Randić matrix of is defined by if the vertic…