Results 1 to 10 of about 195 (89)

Some spectral bounds for the harmonic matrix

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017
The aim of this note is to establish new spectral bounds for the harmonic matrix.
Das Kinkar Ch., Fonseca Carlos M. da
doaj   +1 more source

Sombor spectra of chain graphs. [PDF]

open access: yesHeliyon, 2023
Imran M, Rather BA.
europepmc   +1 more source

A note on the eigenvalue free intervals of some classes of signed threshold graphs

open access: yesSpecial Matrices, 2019
We consider a particular class of signed threshold graphs and their eigenvalues. If Ġ is such a threshold graph and Q(Ġ ) is a quotient matrix that arises from the equitable partition of Ġ , then we use a sequence of elementary matrix operations to prove
Anđelić Milica   +2 more
doaj   +1 more source

Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments

open access: yesSpecial Matrices, 2019
Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact recent analysis shows that the geometric multiplicity theory for the eigenvalues of such matrices closely parallels that for real symmetric (and complex ...
Saiago Carlos M.
doaj   +1 more source

Structures of W(2.2) Lie conformal algebra

open access: yesOpen Mathematics, 2016
The purpose of this paper is to study W(2, 2) Lie conformal algebra, which has a free ℂ[∂]-basis {L, M} such that [LλL]=(∂+2λ)L,[LλM]=(∂+2λ)M,[MλM]=0$\begin{equation}[{L_\lambda }L] = (\partial + 2\lambda )L,[{L_\lambda }M] = (\partial + 2\lambda )M,[{M_\
Yuan Lamei, Wu Henan
doaj   +1 more source

Several Zagreb indices of power graphs of finite non-abelian groups. [PDF]

open access: yesHeliyon, 2023
Ismail R   +5 more
europepmc   +1 more source

On the spectral radius and energy of the degree distance matrix of a connected graph

open access: yesOpen Mathematics
Let GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is ...
Khan Zia Ullah, Hameed Abdul
doaj   +1 more source

Spectral Bayesian network theory. [PDF]

open access: yesLinear Algebra Appl, 2023
Duttweiler L, Thurston SW, Almudevar A.
europepmc   +1 more source

Home - About - Disclaimer - Privacy