Feasibility conditions on the parameters of a strongly regular graph

zbMATH Open1274.05216MaRDI QIDQ2857415FDOQ2857415

Authors: Vasco Moço Mano, Enide Andrade Martins, Luís António de Almeida Vieira 

Publication date: 1 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001685

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Matrix Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Strongly regular graphs, partial geometries and partially balanced designs
• Estimation and testing for lattice conditional independence models on Euclidean Jordan algebras
• Euclidean Jordan algebras with strongly regular graphs

Cited In (4)

• The feasible region of induced graphs
• Euclidean Jordan algebras with strongly regular graphs
• Euclidean Jordan algebras and inequalities on the parameters of a strongly regular graph
• A geometrical characterization of strongly regular graphs

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)