On the Line Graph of a Symmetric Balanced Incomplete Block Design

DOI10.2307/1994116zbMath0144.23303OpenAlexW4243578527MaRDI QIDQ5520567

No author found.

Publication date: 1965

Full work available at URL: https://doi.org/10.2307/1994116

zbMATH Keywords

topology

Related Items (16)

A survey of some problems in combinatorial designs - a matrix approach ⋮ The Second Immanantal Polynomial and the Centroid of a Graph ⋮ Laplacian spectra and spanning trees of threshold graphs ⋮ A note on cospectral graphs ⋮ Line graphs for a multiplex network ⋮ A surprising property of the least eigenvalue of a graph ⋮ Eigenvalues of a graph and its imbeddings ⋮ Line graphs, root systems, and elliptic geometry ⋮ On the edges’ PageRank and line graphs ⋮ A spectral characterization of the line graph of a BIBD with \(\lambda=1\) ⋮ 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 ⋮ Flag algebras of symmetric design ⋮ An interrelation between line graphs, eigenvalues, and matroids ⋮ Lower bounds on the spectra of symmetric matrices with nonnegative entries

Cites Work

• Strongly regular graphs, partial geometries and partially balanced designs
• Finite nets. II: Uniqueness and imbedding
• On the Polynomial of a Graph
• On the line Graph of a Finite Affine Plane
• On the Line Graph of a Projective Plane

This page was built for publication: On the Line Graph of a Symmetric Balanced Incomplete Block Design