Weak-geodetically closed subgraphs in distance-regular graphs

DOI10.1007/s003730050031zbMath0906.05079OpenAlexW2031802485MaRDI QIDQ1268120

Chih-Wen Weng

Publication date: 1 February 1999

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050031

zbMATH Keywords

distance-regular graphHamming graphdual polar graphweak-geodetically closed

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (17)

On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property ⋮ Parallelogram-free distance-regular graphs ⋮ Dual polar graphs, the quantum algebra \(U_q(\mathfrak{sl}_{2})\), and Leonard systems of dual \(q\)-Krawtchouk type ⋮ Further study of distance-regular graphs with classical parameters with \(b < -1\) ⋮ Nonexistence of a class of distance-regular graphs ⋮ A characterization of the Hamming graph by strongly closed subgraphs ⋮ 3-bounded property in a triangle-free distance-regular graph ⋮ Triangle-free distance-regular graphs ⋮ Two new error-correcting pooling designs from \(d\)-bounded distance-regular graphs ⋮ A note on triangle-free distance-regular graphs with \(a_2\neq 0\) ⋮ Almost 2-homogeneous graphs and completely regular quadrangles ⋮ Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\) ⋮ A characterization of some distance-regular graphs by strongly closed subgraphs ⋮ Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\) ⋮ Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs ⋮ An equitable partition for a distance-regular graph of negative type ⋮ Classical distance-regular graphs of negative type

This page was built for publication: Weak-geodetically closed subgraphs in distance-regular graphs