scientific article; zbMATH DE number 3528270
From MaRDI portal
Publication:4105702
Cited in
(27)- A new feasibility condition for distance-regular graphs
- The classification of finite connected hypermetric spaces
- Non-trivial Gamma Delta-regular graphs
- Some optimal designs of block size two
- Optimality and construction of some rectangular designs
- The local density of triangle-free graphs
- The maximal exceptional graphs
- Which graphs are determined by their spectrum?
- On graphs with three eigenvalues
- Small regular graphs with four eigenvalues
- Bipartite density of cubic graphs: The case of equality
- Graphs with least eigenvalue -2; a historical survey and recent developments in maximal exceptional graphs
- Applications of cut polyhedra. II
- Graphs with few distinct eigenvalues and extremal energy
- Regular character-graphs whose eigenvalues are greater than or equal to -2
- On the spectrum and linear programming bound for hypergraphs
- On the order of regular graphs with fixed second largest eigenvalue
- Graph representations, two-distance sets, and equiangular lines
- Maximizing the order of a regular graph of given valency and second eigenvalue
- Exceptional graphs with smallest eigenvalue -2 and related problems
- Spectral Bounds for the k-Regular Induced Subgraph Problem
- The distance-regular graphs such that all of its second largest local eigenvalues are at most one
- The Spectrum of Triangle-Free Graphs
- Cubic graphs with no eigenvalues in the interval (-1,1)
- A new infinite series of regular uniformly geodetic code graphs
- On induced matchings as star complements in regular graphs
- A characterization of Delsarte's linear programming bound as a ratio bound
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4105702)