The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs. Such a graph can be characterized ...
This is a preview. Log in through your library . Abstract A non-backtracking walk on a graph, H, is a directed path of directed edges of H such that no edge is the inverse of its preceding edge.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback