Secular and tidal evolution of circumbinary systems

We investigate the secular dynamics of three-body circumbinary systems under the effect of tides. We use the octupolar non-restricted approximation for the orbital interactions, general relativity corrections, the quadrupolar approximation for the spins, and the viscous linear model for tides. We derive the averaged equations of motion in a simplified vectorial formalism, which is suitable to model the long-term evolution of a wide variety of circumbinary systems in very eccentric and inclined orbits. In particular, this vectorial approach can be used to derive constraints for tidal migration, capture in Cassini states, and stellar spin–orbit misalignment. We show that circumbinary planets with initial arbitrary orbital inclination can become coplanar through a secular resonance between the precession of the orbit and the precession of the spin of one of the stars. We also show that circumbinary systems for which the pericenter of the inner orbit is initially in libration present chaotic motion for the spins and for the eccentricity of the outer orbit. Because our model is valid for the non-restricted problem, it can also be applied to any three-body hierarchical system such as star–planet–satellite systems and triple stellar systems.

Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs

Consider two graphs G and H. Let H^k[G] be the lexicographic product of H^k and G, where H^k is the lexicographic product of the graph H by itself k times. In this paper, we determine the spectrum of H^k[G]H and H^k when G and H are regular and the Laplacian spectrum of H^k[G] and H^k for G and H arbitrary. Particular emphasis is given to the least eigenvalue of the adjacency matrix in the case of lexicographic powers of regular graphs, and to the algebraic connectivity and the largest Laplacian eigenvalues in the case of lexicographic powers of arbitrary graphs. This approach allows the determination of the spectrum (in case of regular graphs) and Laplacian spectrum (for arbitrary graphs) of huge graphs. As an example, the spectrum of the lexicographic power of the Petersen graph with the googol number (that is, 10^100 ) of vertices is determined. The paper finishes with the extension of some well known spectral and combinatorial invariant properties of graphs to its lexicographic powers.