Connected graphs cospectral with a Friendship graph
, 2014 Let $n$ be any positive integer, the friendship graph $F_n$ consist of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a graph $H$ if their adjacency matrices have the same eigenvalues.
Abdollahi, Alireza, Janbaz, Shahrooz
core +1 more source
Potential counter-examples to a conjecture on the column space of the adjacency matrix
Special MatricesAttempts to resolve the Akbari-Cameron-Khosrovshahi-conjecture have so far focused on the rank of a matrix. The conjecture claims that there exists a nonzero (0, 1)-vector in the row space of a (0, 1)-adjacency matrix A{\bf{A}} of a graph GG, that is not
Sciriha Irene +3 more
doaj +1 more source
Several Zagreb indices of power graphs of finite non-abelian groups. [PDF]
Heliyon, 2023 Ismail R +5 more
europepmc +1 more source
On the spectrum, energy and Laplacian energy of graphs with self-loops. [PDF]
Heliyon, 2023 Preetha P U, Suresh M, Bonyah E.
europepmc +1 more source
Spectral Bayesian network theory. [PDF]
Linear Algebra Appl, 2023 Duttweiler L, Thurston SW, Almudevar A.
europepmc +1 more source
Spectral dynamics of guided edge removals and identifying transient amplifiers for death-Birth updating. [PDF]
J Math Biol, 2023 Richter H.
europepmc +1 more source
A New Decomposition of the Graph Laplacian and the Binomial Structure of Mass-Action Systems. [PDF]
J Nonlinear Sci, 2023 Müller S.
europepmc +1 more source
Fluctuations of extreme eigenvalues of sparse Erdős-Rényi graphs. [PDF]
Probab Theory Relat Fields, 2021 He Y, Knowles A.
europepmc +1 more source
Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs. [PDF]
J Math Biol, 2021 Richter H.
europepmc +1 more source
Spectral top-down recovery of latent tree models. [PDF]
Inf inference, 2023 Aizenbud Y +7 more
europepmc +1 more source