Results 21 to 30 of about 179,652 (285)

On the Spectrum of the Derangement Graph [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2007
We derive several interesting formulae for the eigenvalues of the derangement graph and use them to settle affirmatively a conjecture of Ku regarding the least eigenvalue.
openaire   +3 more sources

On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2022
A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced.
Bašić Nino   +3 more
doaj   +1 more source

Tarantula graphs are determined by their Laplacian spectrum

open access: yesElectronic Journal of Graph Theory and Applications, 2021
A graph G is said to be determined by its Laplacian spectrum (DLS) if every graph with the same Laplacian spectrum is isomorphic to G. A graph which is a collection of hexagons (lengths of these cycles can be different) all sharing precisely one vertex ...
Reza Sharafdini, Ali Zeydi Abdian
doaj   +1 more source

Spektrum Laplace pada graf kincir angin berarah (Q_k^3)

open access: yesMajalah Ilmiah Matematika dan Statistika, 2022
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

Spectrum of anti-gallai graph of some graphs

open access: yesIndian Journal of Pure and Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Palathingal, Jeepamol J.   +2 more
openaire   +2 more sources

Some Observations on the Smallest Adjacency Eigenvalue of a Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2020
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

On the spread of the spectrum of a graph

open access: yesDiscrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bolian Liu, Muhuo Liu
openaire   +1 more source

On the Spectra of Commuting and Non Commuting Graph on Dihedral Group

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2017
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

Spectral characterizations of sun graphs and broken sun graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2009
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

The spectrum on prism graph using circulant matrix

open access: yes, 2022
Spectral graph theory discusses about the algebraic properties of graphs based on the spectrum of a graph. This article investigated the spectrum of prism graph. The method used in this research is the circulant matrix.
Triyani, Triyani   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy