Results 91 to 100 of about 272 (159)

Universal Adjacency Matrices with Two Eigenvalues

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  

Laplacian spectral radius and some Hamiltonian properties of graphs, manuscript

, 2014
. Using upper bounds for the spectral radius of graphs established by Cao, we in this note present sufficient conditions which are based on the spectral radius for some Hamiltonian properties of graphs. Keywords: Spectral radius, Hamiltonian property AMS
Rao Li
core  

Spectra of expansion graphs

, 1999
. Replace certain edges of a directed graph by chains and consider the eect on the spectrum of the graph. It is shown that the spectral radius decreases monotonically with the expansion and that, for a strongly connected graph that is not a single cycle,
Hans Schneider, Friedland, Shmuel, Schneider, Hans   +2 more
core   +1 more source

On the minimum spectral radius of connected graphs of given order and size

Special Matrices
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., Gupta Vishal, Marques Celso   +2 more
doaj   +1 more source

Eigenvalues of complex unit gain graphs and gain regularity

Special Matrices
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

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

AMS classifications: 05C50, 05E99;graphs;spectral radius;diameter;bound;degree ...
Koolen, J.H., Cioaba, S.M., Dam, E.R. van, Lee, J.H.   +3 more
core  

Zero Forcing Sets and Bipartite Circulants

, 2010
In this paper we introduce a class of regular bipartite graphs whose biadja-cency matrices are circulant matrices and we describe some of their properties. Notably, we compute upper and lower bounds for the zero forcing number for such a graph based only
Seth A. Meyer
core  

Minimal driver sets on path and cycle graphs with arbitrary non-zero weights

, 2022
Let $G$ be a simple, undirected graph on the vertex set $V=\{1,2,\ldots ,n\}$ and let $A$ be the adjacency matrix of $G.$ A non-empty subset $ \{i_{1},i_{2},\ldots ,i_{k}\}$ of $V$ is called a driver set for $G$ if the system $\mathbf{\dot{x}}=A\mathbf{x}
Maks, Johannes G.
core  

Asymptotic Results on the Spectral Radius and the Diameter of Graphs

2000 Mathematics Subject Classification: 05C50, 05E99;graphs;spectral radius;diameter;limit points ...
Koolen, J.H., Cioaba, S.M., Dam, E.R. van, Lee, J.H.   +3 more
core  

Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs. [PDF]

J Math Biol, 2021
Richter H.
europepmc   +1 more source