Abstract:Let D be a primitive digraph of order n. The exponent of a vertex x in V(D) is denoted γD(x), which is the smallest integer q such that for any vertex y, there is a walk of length q from x to y. Let V(D)={v1,v2,⋯,vn}. We order the vertices of V(D) so that γD(v1)≤γD(v2)≤⋯≤γD(vn) is satisfied. Then, for any integer k satisfying 1≤k≤n,γD(vk) is called the kth local exponent of D and is denoted by expD(k). Let DSn(d) represent the set of all doubly symmetric primitive digraphs with n vertices and d loops, where d … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.