Results 61 to 70 of about 219 (111)
A New Decomposition of the Graph Laplacian and the Binomial Structure of Mass-Action Systems. [PDF]
Müller S.
europepmc +1 more source
Note on the product of the largest and the smallest eigenvalue of a graph
In this note, we use eigenvalue interlacing to derive an inequality between a graph’s maximum degree and its maximum and minimum adjacency eigenvalues. The equality case is fully characterized.
Abiad Aida +2 more
doaj +1 more source
On the minimum spectral radius of connected graphs of given order and size
In this article, we study a question of Hong from 1993 related to the minimum spectral radii of the adjacency matrices of connected graphs of given order and size.
Cioaba Sebastian M. +2 more
doaj +1 more source
Fluctuations of extreme eigenvalues of sparse Erdős-Rényi graphs. [PDF]
He Y, Knowles A.
europepmc +1 more source
Eigenvalues of complex unit gain graphs and gain regularity
A complex unit gain graph (or T{\mathbb{T}}-gain graph) Γ=(G,γ)\Gamma =\left(G,\gamma ) is a gain graph with gains in T{\mathbb{T}}, the multiplicative group of complex units.
Brunetti Maurizio
doaj +1 more source
Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs. [PDF]
Richter H.
europepmc +1 more source
Spectral top-down recovery of latent tree models. [PDF]
Aizenbud Y +7 more
europepmc +1 more source
New constructions of nonregular cospectral graphs
We consider two types of joins of graphs G1{G}_{1} and G2{G}_{2}, G1⊻G2{G}_{1}\hspace{0.33em}⊻\hspace{0.33em}{G}_{2} – the neighbors splitting join and G1∨=G2{G}_{1}\mathop{\vee }\limits_{=}{G}_{2} – the nonneighbors splitting join, and compute ...
Hamud Suleiman, Berman Abraham
doaj +1 more source
Which graphs are rigid in ℓ p d ? [PDF]
Dewar S, Kitson D, Nixon A.
europepmc +1 more source
Chained structure of directed graphs with applications to social and transportation networks. [PDF]
Concas A +4 more
europepmc +1 more source

