Results 71 to 80 of about 292 (163)
A Lower Bound for the Spectral Radius of Graphs with Fixed Diameter [PDF]
AMS classifications: 05C50, 05E99;graphs;spectral radius;diameter;bound;degree ...
Koolen, J.H. +3 more
core
Sensor Location Problem for a Multigraph [PDF]
, 2013 MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35We introduce sparse linear underdetermined systems with embedded network structure. Their structure is inherited from the non-homogeneous network ow programming problems with nodes of variable intensities.
Vishnevetskaya, T. S. +2 more
core
Minimal driver sets on path and cycle graphs with arbitrary non-zero weights [PDF]
, 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
Two chromatic numbers, eigenvalues and a generalized Lovász theta
Special MatricesWe show that Hoffman’s sum-of-eigenvalues bound for the chromatic number is sandwiched between the ceiling of the Lovász theta number of the complement (also known as the strict vector chromatic number) and the fractional chromatic number. In order to do
Carli Silva Marcel K. +2 more
doaj +1 more source
Spectra of R-Vertex Join and R-Edge Join of Two Graphs
Discussiones Mathematicae - General Algebra and Applications, 2018 The R-graph R(G) of a graph G is the graph obtained from G by intro- ducing a new vertex ue for each e ∈ E(G) and making ue adjacent to both the end vertices of e. In this paper, we determine the adjacency, Lapla- cian and signless Laplacian spectra of R-
Das Arpita, Panigrahi Pratima
doaj +1 more source
Vaccination strategy on a geographic network
, 2022 We considered a simple model describing the propagation of an epidemic on a geographical network. The initial rate of growth of the epidemic is the maximal eigenvalue of a matrix formed by the susceptibles and the graph Laplacian.
Knippel, Arnaud +2 more
core
Eigenvalues and perfect matchings [PDF]
, 2004 We give sufficient conditions for existence of a perfect matching in a graph in terms of the eigenvalues of the Laplacian matrix.
Brouwer, A.E. +2 more
core +1 more source
Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]
Heliyon, 2023 Koam ANA +4 more
europepmc +1 more source
Asymptotic Results on the Spectral Radius and the Diameter of Graphs [PDF]
2000 Mathematics Subject Classification: 05C50, 05E99;graphs;spectral radius;diameter;limit points ...
Koolen, J.H. +3 more
core