scientific article
From MaRDI portal
Publication:3127430
zbMath0872.05034MaRDI QIDQ3127430
Publication date: 7 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)
Related Items
Toughness and normalized Laplacian eigenvalues of graphs, Disconnecting strongly regular graphs, On the connectedness of the complement of a ball in distance-regular graphs, Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph, The spectrum and toughness of regular graphs, On the connectivity of graphs in association schemes, Binding number, \(k\)-factor and spectral radius of graphs, Graph toughness from Laplacian eigenvalues, Toughness, Hamiltonicity and spectral radius in graphs, Toughness in pseudo-random graphs, Max-cut and extendability of matchings in distance-regular graphs, Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph, The toughness of Kneser graphs, The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs, Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs, On a conjecture of Brouwer involving the connectivity of strongly regular graphs, A Proof of Brouwer's Toughness Conjecture, Eigenvalues and edge-connectivity of regular graphs, The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs
