14 research outputs found

    On the spectral moments of trees with a given bipartition

    Full text link
    For two given positive integers pp and qq with p⩽qp\leqslant q, we denote \mathscr{T}_n^{p, q}={T: T is a tree of order nn with a (p,q)(p, q)-bipartition}. For a graph GG with nn vertices, let A(G)A(G) be its adjacency matrix with eigenvalues λ1(G),λ2(G),...,λn(G)\lambda_1(G), \lambda_2(G), ..., \lambda_n(G) in non-increasing order. The number Sk(G):=∑i=1nλik(G) (k=0,1,...,n−1)S_k(G):=\sum_{i=1}^{n}\lambda_i^k(G)\,(k=0, 1, ..., n-1) is called the kkth spectral moment of GG. Let S(G)=(S0(G),S1(G),...,Sn−1(G))S(G)=(S_0(G), S_1(G),..., S_{n-1}(G)) be the sequence of spectral moments of GG. For two graphs G1G_1 and G2G_2, one has G1≺sG2G_1\prec_s G_2 if for some k∈1,2,...,n−1k\in {1,2,...,n-1}, Si(G1)=Si(G2)(i=0,1,...,k−1)S_i(G_1)=S_i(G_2) (i=0,1,...,k-1) and Sk(G1)<Sk(G2)S_k(G_1)<S_k(G_2) holds. In this paper, the last four trees, in the SS-order, among Tnp,q(4⩽p⩽q)\mathscr{T}_n^{p, q} (4\leqslant p\leqslant q) are characterized.Comment: 11 pages, 7 figure

    Dynamical Directions in Numeration

    Get PDF
    International audienceWe survey definitions and properties of numeration from a dynamical point of view. That is we focuse on numeration systems, their associated compactifications, and the dynamical systems that can be naturally defined on them. The exposition is unified by the notion of fibred numeration system. A lot of examples are discussed. Various numerations on natural, integral, real or complex numbers are presented with a special attention payed to beta-numeration and its generalisations, abstract numeration systems and shift radix systems. A section of applications ends the paper

    29th International Symposium on Algorithms and Computation: ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan

    Get PDF

    LIPIcs, Volume 261, ICALP 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 261, ICALP 2023, Complete Volum

    LIPIcs, Volume 244, ESA 2022, Complete Volume

    Get PDF
    LIPIcs, Volume 244, ESA 2022, Complete Volum

    27th Annual European Symposium on Algorithms: ESA 2019, September 9-11, 2019, Munich/Garching, Germany

    Get PDF

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    35th Symposium on Theoretical Aspects of Computer Science: STACS 2018, February 28-March 3, 2018, Caen, France

    Get PDF
    corecore