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.
L-structured quaternion matrices and quaternion linear matrix equations
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Three new iterative algorithms compute generalized inverses of quaternion matrices with accuracy matching or exceeding standard methods like SVD while being faster, and they improve large-scale solvers and applications like image completion.
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.
-
A Family of Iterative Methods for Computing Generalized Inverses of Quaternion Matrices and its Applications
Three new iterative algorithms compute generalized inverses of quaternion matrices with accuracy matching or exceeding standard methods like SVD while being faster, and they improve large-scale solvers and applications like image completion.