On the Line Graph of a Symmetric Balanced Incomplete Block Design
From MaRDI portal
Cites work
Cited in
(17)- Lower bounds on the spectra of symmetric matrices with nonnegative entries
- A survey of some problems in combinatorial designs - a matrix approach
- A note on cospectral graphs
- A surprising property of the least eigenvalue of a graph
- Line graphs, root systems, and elliptic geometry
- A spectral characterization of the line graph of a BIBD with \(\lambda=1\)
- Flag algebras of symmetric design
- Laplacian spectra and spanning trees of threshold graphs
- Eigenvalues of a graph and its imbeddings
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- On characterizing certain graphs with four eigenvalues by their spectra
- The characteristic polynomial of a graph
- An interrelation between line graphs, eigenvalues, and matroids
- The Second Immanantal Polynomial and the Centroid of a Graph
- Line graphs for a multiplex network
- On the edges’ PageRank and line graphs
- On the least eigenvalue of genuine strongly 3-walk-regular graphs
This page was built for publication: On the Line Graph of a Symmetric Balanced Incomplete Block Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5520567)
