Multiplicative cones - a family of three eigenvalue graphs
From MaRDI portal
Publication:1161759
DOI10.1007/BF02190180zbMath0481.05043OpenAlexW2047978871MaRDI QIDQ1161759
Publication date: 1981
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/136874
Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs ⋮ More on graphs with just three distinct eigenvalues ⋮ Biregular graphs with three eigenvalues ⋮ Hypercubes are determined by their distance spectra ⋮ On regular graphs with four distinct eigenvalues ⋮ Combinatorial designs with two singular values. I: Uniform multiplicative designs ⋮ Graphs with few matching roots ⋮ On 2-equitable graphs ⋮ Difference sets with few character values ⋮ Graphs with two main and two plain eigenvalues ⋮ Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues ⋮ The maximal exceptional graphs ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation ⋮ Graphs with four distinct Laplacian eigenvalues ⋮ Graphs whose certain polynomials have few distinct roots ⋮ Trees with Four and Five Distinct Signless Laplacian Eigenvalues ⋮ A note on graphs whose signless Laplacian has three distinct eigenvalues ⋮ Graphs with three distinct \(\alpha\)-eigenvalues ⋮ Universal adjacency matrices with two eigenvalues ⋮ Graphs whose normalized Laplacian has three eigenvalues ⋮ Unnamed Item ⋮ Graphs with few distinct eigenvalues and extremal energy ⋮ On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity ⋮ Some results on overgraphs of a strongly regular graph ⋮ Open problems in the spectral theory of signed graphs ⋮ A nonregular analogue of conference graphs ⋮ Some new aspects of main eigenvalues of graphs ⋮ Graphs with three distinct eigenvalues and largest eigenvalue less than 8 ⋮ ON THE ROOTS OF TOTAL DOMINATION POLYNOMIAL OF GRAPHS, II ⋮ Nonregular graphs with three eigenvalues ⋮ On graphs with three eigenvalues ⋮ Construction of integral graphs ⋮ Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5 ⋮ Tactical decompositions in uniform normal designs
Cites Work
- Unnamed Item
- Multiplicative designs I: The normal and reducible cases
- Multiplicative designs II. Uniform normal and related structures
- On the replications of certain multiplicative designs
- Symmetric designs and related configurations
- On a combinatorial generalization of 27 lines associated with a cubic surface
