Introduces eccentricity Laplacian and signless Laplacian matrices, establishes their spectral equivalences for graph classes, and characterizes E-bipartite graphs via spectrum symmetry and matrix similarity.
A new version of Schur–Horn type theorem
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Generalizes Williamson's theorem to real symmetric matrices allowing arbitrary real symplectic eigenvalues, with explicit constructions and perturbation bounds for the class EigSpSm(2n).
The BURSTT back-end system achieves real-time multi-stage beamforming and de-dispersion search to detect FRBs and trigger VLBI localization using RFSoC and optimized server processing.
A survey compiling the history, development, and applications of Tian's evolution algebras since their introduction.
citing papers explorer
-
On the Eccentricity Laplacian and Eccentricity Signless Laplacian Matrices of a Graph
Introduces eccentricity Laplacian and signless Laplacian matrices, establishes their spectral equivalences for graph classes, and characterizes E-bipartite graphs via spectrum symmetry and matrix similarity.
-
On generalization of Williamson's theorem to real symmetric matrices
Generalizes Williamson's theorem to real symmetric matrices allowing arbitrary real symplectic eigenvalues, with explicit constructions and perturbation bounds for the class EigSpSm(2n).
-
Back-End System of BURSTT
The BURSTT back-end system achieves real-time multi-stage beamforming and de-dispersion search to detect FRBs and trigger VLBI localization using RFSoC and optimized server processing.
-
A historical perspective of Tian's evolution algebras
A survey compiling the history, development, and applications of Tian's evolution algebras since their introduction.