Feasibility conditions on the parameters of a strongly regular graph
From MaRDI portal
Publication:2857415
Recommendations
- On generalized binomial series and strongly regular graphs
- Values of lambda and mu for which there are only finitely many feasible (v,k,lambda,mu)
- Euclidean Jordan algebras and inequalities on the parameters of a strongly regular graph
- Euclidean Jordan Algebras and Strongly Regular Graphs
- New feasibility conditions for directed strongly regular graphs
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- Estimation and testing for lattice conditional independence models on Euclidean Jordan algebras
- Euclidean Jordan algebras with strongly regular graphs
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Matrix Analysis
- Strongly regular graphs, partial geometries and partially balanced designs
Cited in
(4)
This page was built for publication: Feasibility conditions on the parameters of a strongly regular graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857415)