13 citations · 16 across the 8 of their papers we have counts for
6 papers · 1 filter
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…
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…
Constructing cospectral signed graphs
Francesco Belardo, Maurizio Brunetti, Matteo Cavaleri +1
A well--known fact in Spectral Graph Theory is the existence of pairs of isospectral nonisomorphic graphs (known as PINGS). The work of A.J. Schwenk (in 1973) and of C. Godsil and…
On a Graph Connecting Hyperbinary Expansions
M. Brunetti, A. D'Aniello
Le n be any positive integer. A hyperbinary expansion of n is are presentation of n as sum of powers of 2, each power being used at most twice. In this paper we study some properti…