Abstract

We characterize those linear operators L such that for all digraphsD,L(D) has maximal cycle length L if an only if D has maximum cycle length L. We do this for L =0 and L = 1, the cases L ≤2 having been done previously.

Full Text
Published version (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