On the connectivity of graphs in association schemes
From MaRDI portal
Publication:1691090
zbMath1386.05197arXiv1702.03801MaRDI QIDQ1691090
William J. Martin, Brian G. Kodalen
Publication date: 15 January 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.03801
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)
Related Items (3)
Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph ⋮ The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs ⋮ The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the connectedness of the complement of a ball in distance-regular graphs
- Max-cut and extendability of matchings in distance-regular graphs
- Nonexistence of exceptional imprimitive \(Q\)-polynomial association schemes with six classes
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- Imprimitive cometric association schemes: constructions and analysis
- The vertex-connectivity of a distance-regular graph
- Non-existence of imprimitive \(Q\)-polynomial schemes of exceptional type with \(d=4\)
- There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three
- Commutative association schemes
- Eigenvalues and edge-connectivity of regular graphs
- The connectivity of strongly regular graphs
- Equiarboreal graphs
- Spherical codes and designs
- Imprimitive Q-polynomial association schemes
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Über den Zusammenhang symmetrischer Graphen
- Disconnecting strongly regular graphs
- Connectivity of transitive graphs
This page was built for publication: On the connectivity of graphs in association schemes
