Publication venue
Publication date 20/11/2012
Field of study Full text link For two given positive integers p p p and q q q with p ⩽ q p\leqslant q p ⩽ q , we denote
\mathscr{T}_n^{p, q}={T: T is a tree of order n n n with a ( p , q ) (p,
q) ( p , q ) -bipartition}. For a graph G G G with n n n vertices, let A ( G ) 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) λ 1 ​ ( G ) , λ 2 ​ ( G ) , ... , λ n ​ ( G ) in non-increasing order. The number
S k ( G ) : = ∑ i = 1 n λ i k ( G )   ( k = 0 , 1 , . . . , n − 1 ) S_k(G):=\sum_{i=1}^{n}\lambda_i^k(G)\,(k=0, 1, ..., n-1) S k ​ ( G ) := ∑ i = 1 n ​ λ i k ​ ( G ) ( k = 0 , 1 , ... , n − 1 ) is called the k k k th
spectral moment of G G G . Let S ( G ) = ( S 0 ( G ) , S 1 ( G ) , . . . , S n − 1 ( G ) ) S(G)=(S_0(G), S_1(G),..., S_{n-1}(G)) S ( G ) = ( S 0 ​ ( G ) , S 1 ​ ( G ) , ... , S n − 1 ​ ( G )) be the
sequence of spectral moments of G G G . For two graphs G 1 G_1 G 1 ​ and G 2 G_2 G 2 ​ , one has
G 1 ≺ s G 2 G_1\prec_s G_2 G 1 ​ ≺ s ​ G 2 ​ if for some k ∈ 1 , 2 , . . . , n − 1 k\in {1,2,...,n-1} k ∈ 1 , 2 , ... , n − 1 , S i ( G 1 ) = S i ( G 2 ) ( i = 0 , 1 , . . . , k − 1 ) S_i(G_1)=S_i(G_2)
(i=0,1,...,k-1) S i ​ ( G 1 ​ ) = S i ​ ( G 2 ​ ) ( i = 0 , 1 , ... , k − 1 ) and S k ( G 1 ) < S k ( G 2 ) S_k(G_1)<S_k(G_2) S k ​ ( G 1 ​ ) < S k ​ ( G 2 ​ ) holds. In this paper, the last four
trees, in the S S S -order, among T n p , q ( 4 ⩽ p ⩽ q ) \mathscr{T}_n^{p, q} (4\leqslant p\leqslant q) T n p , q ​ ( 4 ⩽ p ⩽ q )
are characterized.Comment: 11 pages, 7 figure
Publication venue Association des Annales de l'Institut Fourier
Publication date 01/01/2006
Field of study 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
Publication venue Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
Publication date 01/12/2018
Field of study Get PDF
Publication venue LIPIcs - Leibniz International Proceedings in Informatics. 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Publication date 01/01/2023
Field of study Get PDF LIPIcs, Volume 261, ICALP 2023, Complete Volum
Publication venue LIPIcs - Leibniz International Proceedings in Informatics. 30th Annual European Symposium on Algorithms (ESA 2022)
Publication date 01/01/2022
Field of study Get PDF LIPIcs, Volume 244, ESA 2022, Complete Volum
Publication venue Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
Publication date 01/09/2019
Field of study Get PDF
Publication venue LIPIcs - Leibniz International Proceedings in Informatics. 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)
Publication date 01/01/2023
Field of study Get PDF LIPIcs, Volume 251, ITCS 2023, Complete Volum
Publication venue Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
Publication date 01/02/2018
Field of study Get PDF