Multiplicative cones - a family of three eigenvalue graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3341149 (Why is no real title available?)
- Multiplicative designs I: The normal and reducible cases
- Multiplicative designs II. Uniform normal and related structures
- On a combinatorial generalization of 27 lines associated with a cubic surface
- On the replications of certain multiplicative designs
- Symmetric designs and related configurations
Cited in
(38)- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- Tactical decompositions in uniform normal designs
- Nonregular graphs with three eigenvalues
- The maximal exceptional graphs
- On graphs with three eigenvalues
- Construction of integral graphs
- A nonregular analogue of conference graphs
- Graphs with least eigenvalue -2; a historical survey and recent developments in maximal exceptional graphs
- Graphs with three distinct -eigenvalues
- Graphs with few distinct eigenvalues and extremal energy
- Some new aspects of main eigenvalues of graphs
- Biregular graphs with three eigenvalues
- Hypercubes are determined by their distance spectra
- A note on graphs whose signless Laplacian has three distinct eigenvalues
- On regular graphs with four distinct eigenvalues
- On the roots of total domination polynomial of graphs. II
- Graphs with few matching roots
- Difference sets with few character values
- Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
- On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
- Graphs whose certain polynomials have few distinct roots
- More on graphs with just three distinct eigenvalues
- Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
- On 2-equitable graphs
- Trees with Four and Five Distinct Signless Laplacian Eigenvalues
- Open problems in the spectral theory of signed graphs
- Universal adjacency matrices with two eigenvalues
- Graphs whose normalized Laplacian has three eigenvalues
- The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- Graphs with two main and two plain eigenvalues
- Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues
- On split graphs with three or four distinct (normalized) Laplacian eigenvalues
- Graphs with four distinct Laplacian eigenvalues
- Unified approach for spectral properties of weighted adjacency matrices for graphs with degree-based edge-weights
- Some results on overgraphs of a strongly regular graph
- On walk-semiregular graphs with three or four distinct eigenvalues
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
This page was built for publication: Multiplicative cones - a family of three eigenvalue graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1161759)