Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the following generalization of distance-regular digraphs. A connected digraph @C is said to be akly distance-regular if, for all vertices x and y with (@?(x,y),@?(y,x))=h@?, |{z@?V@C|(@?(x,z),@?(z,x))=i@?and(@?(z,y),@?(y,z))=j@?}| depends only on h@?,i@? and j@?.  give some constructions of akly distance-regular digraphs and discuss the connections to association schemes. Finally,  determine all commutative akly distance-regular digraphs of valency 2.
['Kaishun Wang', 'Hiroshi Suzuki']
I am writing a research paper on a idea Weakly distance-regular digraphs
[{"from": "human", "value": "I am writing a research paper on a idea Weakly distance-regular digraphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the following generalization of distance-regular digraphs. A connected digraph @C is said to be akly distance-regular if, for all vertices x and y with (@?(x,y),@?(y,x))=h@?, |{z@?V@C|(@?(x,z),@?(z,x))=i@?and(@?(z,y),@?(y,z))=j@?}| depends only on h@?,i@? and j@?.  give some constructions of akly distance-regular digraphs and discuss the connections to association schemes. Finally,  determine all commutative akly distance-regular digraphs of valency 2."}]