Results 81 to 90 of about 2,530 (150)
Eigenvalues and Perfect Matchings [PDF]
AMS classification: 05C50, 05C70, 05E30.graph;perfect matching;Laplacian matrix;eigenvalues.
Brouwer, A.E., Haemers, W.H.
core +1 more source
Spectra of R-Vertex Join and R-Edge Join of Two Graphs
Discussiones Mathematicae - General Algebra and Applications, 2018 The R-graph R(G) of a graph G is the graph obtained from G by intro- ducing a new vertex ue for each e ∈ E(G) and making ue adjacent to both the end vertices of e. In this paper, we determine the adjacency, Lapla- cian and signless Laplacian spectra of R-
Das Arpita, Panigrahi Pratima
doaj +1 more source
Enumeration of Cospectral Graphs [PDF]
AMS classification: 05C50;graphs;eigenvalues ...
Haemers, W.H., Spence, E.
core +1 more source
The Minimal Spectral Radius of Graphs with a Given Diameter [PDF]
AMS classsifications: 05C50; 05E99; 94C15;graphs;spectral radius;diameter;networks;virus ...
Dam, E.R. van, Kooij, R.E.
core +1 more source
Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]
Heliyon, 2023 Koam ANA +4 more
europepmc +1 more source
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
Some spectral bounds for the harmonic matrix
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017 The aim of this note is to establish new spectral bounds for the harmonic matrix.
Das Kinkar Ch., Fonseca Carlos M. da
doaj +1 more source
A note on the eigenvalue free intervals of some classes of signed threshold graphs
Special Matrices, 2019 We consider a particular class of signed threshold graphs and their eigenvalues. If Ġ is such a threshold graph and Q(Ġ ) is a quotient matrix that arises from the equitable partition of Ġ , then we use a sequence of elementary matrix operations to prove
Anđelić Milica +2 more
doaj +1 more source
Special Matrices, 2019 Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact recent analysis shows that the geometric multiplicity theory for the eigenvalues of such matrices closely parallels that for real symmetric (and complex ...
Saiago Carlos M.
doaj +1 more source