Results 21 to 30 of about 175,546 (265)

Some Observations on the Smallest Adjacency Eigenvalue of a Graph

Discussiones Mathematicae Graph Theory, 2020
In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are based on Rayleigh
Cioabă Sebastian M., Elzinga Randall J., Gregory David A.   +2 more
doaj   +1 more source

Spectrum of anti-gallai graph of some graphs

Indian Journal of Pure and Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Palathingal, Jeepamol J., Lakshmanan, Aparna S., Indulal, Gopalapillai   +2 more
openaire   +2 more sources

On the spread of the spectrum of a graph

Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bolian Liu, Muhuo Liu
openaire   +1 more source

On the Spectra of Commuting and Non Commuting Graph on Dihedral Group

Cauchy: Jurnal Matematika Murni dan Aplikasi, 2017
Study about spectra of graph has became interesting work as well as study about commuting and non commuting graph of a group or a ring. But the study about spectra of commuting and non commuting graph of dihedral group has not been done yet.
Abdussakir Abdussakir, Rivatul Ridho Elvierayani, Muflihatun Nafisah   +2 more
doaj   +1 more source

Spectral characterizations of sun graphs and broken sun graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2009
Several matrices can be associated to a graph such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question ''Which graphs are determined by their spectrum?''
Romain Boulet
doaj   +1 more source

Cospectral Pairs of Regular Graphs with Different Connectivity

Discussiones Mathematicae Graph Theory, 2020
For vertex- and edge-connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
Haemers Willem H.
doaj   +1 more source

Graphs With All But Two Eigenvalues In [−2, 0]

Discussiones Mathematicae Graph Theory, 2020
The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette characterized all graphs with all but two eigenvalues equal to −2 and 0.
Abreu Nair, Alencar Jorge, Brondani André, de Lima Leonardo, Oliveira Carla   +4 more
doaj   +1 more source

Spectral divergence prioritizes key classes, genes, and pathways shared between substance use disorders and cardiovascular disease

Frontiers in Neuroscience
IntroductionSubstance use disorders (SUDs) are heterogeneous diseases with overlapping biological mechanisms and often present with co-occurring disease, such as cardiovascular disease (CVD).
Everest Castaneda, Everest Castaneda, Elissa Chesler, Erich Baker   +3 more
doaj   +1 more source

The coalescence of multi-wheel and starlike graphs is DLS [PDF]

Journal of Mahani Mathematical Research
The Laplacian spectrum of a graph is obtained by taking the difference of the adjacency spectrum from the diagonal matrix of degrees. If a graph has a unique Laplacian spectrum,  it means that  it can be identified by this spectrum, it is called $DLS ...
Mohammad Hasan Ahangarani Farahani, Gholam Hossein Fath-Tabar   +1 more
doaj   +1 more source

The spectral determination of the connected multicone graphs

AKCE International Journal of Graphs and Combinatorics, 2021
The main goal of the paper is to answer an unsolved problem. A multicone graph is defined to be the join of a clique and a regular graph, and a wheel as the join of a vertex and a cycle.
Ali Zeydi Abdian, Lowell W. Beineke, Krishnaiyan Thulasiraman, Reza Tayebi Khorami, Mohammad Reza Oboudi   +4 more
doaj   +1 more source