Abstract
The exponent of a primitive digraph is the smallest integer k such that for each ordered pair of (not necessarily distinct) vertices x and y there is a walk of length k from x to y. As a generalization of exponent, Brualdi and Liu (Linear Algebra Appl. 14 (1990) 483–499) introduced three types of generalized exponents for primitive digraphs in 1990. In this paper we extend their definitions of generalized exponents from primitive digraphs to general digraphs which are not necessarily primitive. We give necessary and sufficient conditions for the finiteness of these generalized exponents for graphs (undirected, corresponding to symmetric digraphs) and completely determine the largest finite values and the exponent sets of generalized exponents for the class of non-primitive graphs of order n, the class of connected bipartite graphs of order n and the class of trees of order n.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
