Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let @C denote a distance-regular graph with classical parameters (D,b,@a,@b) and D>=3. Assume the intersection numbers a"1=0 and a"2 0.  show that @C is 3-bounded in the sense of the article [C. ng, D-bounded distance-regular graphs, European Journal of Combinatorics 18 (1997) 211-229].
['Y.-W. Pan', 'Chih-wen Weng']
I am writing a research paper on a idea 3-bounded property in a triangle-free distance-regular graph
[{"from": "human", "value": "I am writing a research paper on a idea 3-bounded property in a triangle-free distance-regular graph"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let @C denote a distance-regular graph with classical parameters (D,b,@a,@b) and D>=3. Assume the intersection numbers a\"1=0 and a\"2 0.  show that @C is 3-bounded in the sense of the article [C. ng, D-bounded distance-regular graphs, European Journal of Combinatorics 18 (1997) 211-229]."}]