D-bounded Distance-regular Graphs
โ
Chih-Wen Weng
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 314 KB
Let โซ ฯญ ( X , R ) denote a distance-regular graph with diameter D ั 3 and distance function โฆ . A (vertex) subgraph โฌ ' X is said to be weak -geodetically closed whenever for all x , y โฌ and all z X , โซ is said to be D -bounded whenever , for all x , y X , x and y are contained in a common regular