Large equiangular sets of lines in euclidean space.

de Caen, D.

Displaying similar documents to “Large equiangular sets of lines in euclidean space.”

The strongly regular (45, 12, 3, 3) graphs.

Coolsaet, Kris, Degraer, Jan, Spence, Edward (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Cutpoints, lobes and the spectra of graphs

Grone, Robert, Merris, Russell (1988)

Portugaliae mathematica

Similarity:

The strongly regular (40, 12, 2, 4) graphs.

Spence, E. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A matrix representation of graphs and its spectrum as a graph invariant.

Emms, David, Hancock, Edwin R., Severini, Simone, Wilson, Richard C. (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

An eigenvalue characterization of antipodal distance-regular graphs.

Fiol, M.A. (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Problems in algebraic combinatorics.

Godsil, C.D. (1994)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Signed graphs with at most three eigenvalues

Farzaneh Ramezani, Peter Rowlinson, Zoran Stanić (2022)

Czechoslovak Mathematical Journal

Similarity:

We investigate signed graphs with just 2 or 3 distinct eigenvalues, mostly in the context of vertex-deleted subgraphs, the join of two signed graphs or association schemes.

On the first eigenvalue of bipartite graphs.

Bhattacharya, Amitava, Friedland, Shmuel, Peled, Uri N. (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Eigenvalues and the max-cut problem

Bojan Mohar, Svatopluk Poljak (1990)

Czechoslovak Mathematical Journal

Similarity:

Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property.

Bonato, Anthony, Holzmann, W.H., Kharaghani, Hadi (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Some properties of the distance Laplacian eigenvalues of a graph

Mustapha Aouchiche, Pierre Hansen (2014)

Czechoslovak Mathematical Journal

Similarity:

The distance Laplacian of a connected graph $G$ is defined by $ℒ = Diag (Tr) - 𝒟$ , where $𝒟$ is the distance matrix of $G$ , and $Diag (Tr)$ is the diagonal matrix whose main entries are the vertex transmissions in $G$ . The spectrum of $ℒ$ is called the distance Laplacian spectrum of $G$ . In the present paper, we investigate some particular distance Laplacian eigenvalues. Among other results, we show that the complete graph is the unique graph with only two distinct distance Laplacian eigenvalues. We establish some properties...