The spectrum for a class of graph designs
From MaRDI portal
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Recommendations
- scientific article; zbMATH DE number 2188475
- The chromatic spectrum of graph designs
- scientific article; zbMATH DE number 1529468
- The spectra of arrangement graphs
- Spectra of graphs
- scientific article; zbMATH DE number 1219775
- Spectra of Some Graphs
- scientific article; zbMATH DE number 3929044
- Some properties of the spectrum of graphs
- Spectrum for multigraph designs on four vertices and six edges
Cited in
(9)- The spectra of arrangement graphs
- On the spectrum of nested G-designs, where G has four non-isolated vertices or less
- Resolvable G-designs of order v and index {\lambda}
- The spectrum of \(\mathrm{Meta}(K_4-e> K_3+e,\lambda)\) with any \(\lambda\)
- On the spectrum for Km+2 \ Km designs
- scientific article; zbMATH DE number 1961004 (Why is no real title available?)
- scientific article; zbMATH DE number 2165838 (Why is no real title available?)
- Generalized designs on graphs: Sampling, spectra, symmetries
- scientific article; zbMATH DE number 2188475 (Why is no real title available?)
This page was built for publication: The spectrum for a class of graph designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895413)