Search arXiv⌕ Search

arXiv · 0709.3549

Euclidean Jordan Algebras and Generalized Krein parameters of a strongly regular graph

Abstract

Let $τ$ be a strongly $(n,p;a,c)$ regular graph,such that $0<c<p<n-1,$ $A$ his matrix of adjacency and let ${\cal V}_{n}$ be the Euclidean space spanned by the powers of $A$ over the reals where the scallar product $\bullet|\bullet$ is defined by $x|y={trace}(x \cdot y).$ In this work ones proves that ${\cal V}_{n}$ is an Euclidean Jordan algebra of rank 3 when one introduces in ${\cal V}_{n}$ the usual product of matrices. In this Euclidean Jordan algebra one defines the modulus of a matrix, and afterwards one defines $|A|^x \forall x\in \mathbb{R}.$ Working inside the Euclidean Jordan algebra ${\cal V}_{n}$ and making use of the properties of $|A|^x$ one defines the generalized krein parameters of the strongly $(n,p;a,c)$ regular graph $τ$ and finally one presents necessary conditions over the parameters and the spectra of the $τ$ strongly $(n,p;a,c)$ regular graph.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luis Vieira. 2008-03-26. Euclidean Jordan Algebras and Generalized Krein parameters of a strongly regular graph. https://arxiv.org/abs/0709.3549

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗