Found 1 document(s)
Page 1 of 1
-
Nilpotent adjacency matrix methods are employed to enumerate $k$-cycles in simple graphs on $n$ vertices for any $k\le n$. The worst-case time complexity of counting $k$-cycles in an $n$-vertex simple graph is shown to b...