17 research outputs found
On arc reversal in balanced digraphs
AbstractIn this note we consider closed walks, which are cycles that are not necessarily elementary. We prove that any arc reversal in a balanced multidigraph without loops decreases the number of closed walks. This also proves that arc reversal in a simple balanced digraph decreases the number of closed walks
Extremal energies of integral circulant graphs via multiplicativity
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. Integral circulant graphs can be characterised by their order n and a set D of positive divisors of n in such a way that they have vertex set Z/nZ and edge set {(a,b):a,bâZ/nZ,gcd(a-b,n)âD}. Among integral circulant graphs of fixed prime power order ps, those having minimal energy Eminps or maximal energy Emaxps, respectively, are known. We study the energy of integral circulant graphs of arbitrary order n with so-called multiplicative divisor sets. This leads to good bounds for Eminn and Emaxn as well as conjectures concerning the true value of Eminn
On automorphisms of circulant digraphs on pm vertices, p an odd prime
AbstractThe circulant digraph Î is considered when the number n of vertices of Î is equal to pm for an odd prime p. The main results are an implicit characterization of the groups Aut(Î) in the general case, and an explicit characterization in the case n=p4. The argument is based on spectral techniques and classical constructions of permutation groups