Results 71 to 80 of about 272 (159)

Uniformity in Association schemes and Coherent Configurations: Cometric Q-Antipodal Schemes and Linked Systems

open access: yes
2010 Mathematics Subject Classification.
Dam, E.R. van   +2 more
core  

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

Eigenvalues of the Adjacency Tensor on Products of Hypergraphs [PDF]

open access: yes, 2013
We consider the generalized notions of Cartesian and tensor products on m-uniform hypergraphs. The adjacency tensor is analogous to the adjacency matrix and two different notions of eigenvalues of the adjacency tensor on the products of hypergraphs are ...
Kelly J Pearson, Tan Zhang
core  

Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs

open access: yes, 1998
We show that computing (and even approximating) MAXIMUM CLIQUE and MINIMUM GRAPH COLORING for circulant graphs is essentially as hard as in the general case.
Ivan Gerace   +8 more
core   +1 more source

Kernels of directed graph Laplacians [PDF]

open access: yes, 2020
. Let G denote a directed graph with adjacency matrix Q and in-degree matrix D. We consider the Kirchhoff matrix L = D−Q, sometimes referred to as the directed Laplacian. A classical result of Kirchhoff asserts that when G is undirected, the multiplicity
J S Caughman, J J P Veerman
core  

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