Results 81 to 90 of about 292 (163)
On Almost Distance-Regular Graphs [PDF]
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graph;walk-regular graph;eigenvalues;predistance ...
Fiol, M.A. +4 more
core
Universal Adjacency Matrices with Two Eigenvalues [PDF]
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core
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
The Minimal Spectral Radius of Graphs with a Given Diameter [PDF]
AMS classsifications: 05C50; 05E99; 94C15;graphs;spectral radius;diameter;networks;virus ...
Kooij, R.E., Dam, E.R. van
core
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
Eigenvalues and Perfect Matchings [PDF]
AMS classification: 05C50, 05C70, 05E30.graph;perfect matching;Laplacian matrix;eigenvalues.
Brouwer, A.E., Haemers, W.H.
core
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
Cospectral Graphs and the Generalized Adjacency Matrix [PDF]
AMS classifications: 05C50; 05E99;cospectral graphs;generalized spectrum;generalized adjacency ...
Koolen, J.H. +2 more
core
On strongly regular graphs with m2 = qm3 and m3 = qm2 [PDF]
, 2011 2010 Mathematics Subject Classification: 05C50.We say that a regular graph G of order n and degree r і 1 (which is not the complete graph) is strongly regular if there exist non-negative integers t and q such that |SiЗSj| = t for any two adjacent ...
Lepovic, Mirko
core
Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs
, 1998 We show that computing (and even approximating) MAXIMUM CLIQUE and MINIMUM GRAPH COLORING for circulant graphs is essentially as hard as in the general case.
Ivan Gerace +5 more
core +1 more source