Results 31 to 40 of about 169,163 (265)
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah +2 more
doaj +1 more source
Subsampling for graph power spectrum estimation [PDF]
Contains 4 figures. Matlab scripts to reproduce these results can be downloaded from: http://cas.et.tudelft.nl/~sundeep/sw/gpsd ...
Chepuri, Sundeep Prabhakar, Leus, Geert
openaire +2 more sources
Cospectral Pairs of Regular Graphs with Different Connectivity
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]
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 +4 more
doaj +1 more source
On the Spectra of Commuting and Non Commuting Graph on Dihedral Group
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 +2 more
doaj +1 more source
The distance spectrum of corona and cluster of two graphs
Let G be a connected graph with a distance matrix D. The D-eigenvalues {μ1,μ2,…,…,μp} of G are the eigenvalues of D and form the distance spectrum or D-spectrum of G.
G. Indulal, Dragan Stevanović
doaj +1 more source
Spectral characterizations of sun graphs and broken sun graphs [PDF]
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
Spectrum of Strongly Regular Graphs under Graph Operators
In this paper, we show that if G is strongly regular then the Gallai graph and the anti-Gallai graph of G are edge-regular. We also identify conditions under which the Gallai and anti-Gallai graphs are themselves strongly regular, as well as conditions under which they are 2-connected.
Palathingal, Jeepamol J +2 more
openaire +2 more sources
Some Observations on the Smallest Adjacency Eigenvalue of a Graph
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. +2 more
doaj +1 more source
Graphs with clusters perturbed by regular graphs --- A_α-spectrum and applications
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cardoso, Domingos M. +2 more
openaire +3 more sources

