Results 61 to 70 of about 2,306 (105)

A Lower Bound for the Spectral Radius of Graphs with Fixed Diameter [PDF]

AMS classifications: 05C50, 05E99;graphs;spectral radius;diameter;bound;degree ...
Cioaba, S.M., Dam, E.R. van, Koolen, J.H., Lee, J.H.   +3 more
core   +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

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 stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]

Heliyon, 2023
Koam ANA, Ahmad A, Azeem M, Hakami KH, Elahi K.   +4 more
europepmc   +1 more source

Sombor spectra of chain graphs. [PDF]

Heliyon, 2023
Imran M, Rather BA.
europepmc   +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, Koledin Tamara, Stanić Zoran   +2 more
doaj   +1 more source

Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments

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

Several Zagreb indices of power graphs of finite non-abelian groups. [PDF]

Heliyon, 2023
Ismail R, Ali F, Qasim R, Naeem M, Mashwani WK, Khan S.   +5 more
europepmc   +1 more source