Abstract
Consider a finite directed graph (loops allowed) such that the number of directed paths from vertex i to vertex j of length three is a fixed non-zero number for every distinct pair ( i, j). If the graph has more than two vertices it is regular.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
