Results 71 to 80 of about 279 (161)
Spectra of R-Vertex Join and R-Edge Join of Two Graphs
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
Biclique Decompositions and Hermitian Rank [PDF]
The Hermitian rank, h(A), of a Hermitian matrix A is defined and shown to equal maxfn+ (A); n \Gamma (A)g, the maximum of the numbers of positive and negative eigenvalues of A.
Valerie L. Watts +6 more
core +1 more source
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
Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique
05C50; 05E30; 51E05; Divisible design graph; Strongly regular graph; Symmetric ...
Gavrilyuk, Alexander L. +1 more
core +1 more source
Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]
Koam ANA +4 more
europepmc +1 more source
Sensor Location Problem for a Multigraph [PDF]
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
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
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
Vaccination strategy on a geographic network
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

