Premium
On a Poset of Trees II
Author(s) -
Csikvári Péter
Publication year - 2013
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21693
Subject(s) - mathematics , combinatorics , partially ordered set , star (game theory) , adjacency matrix , laplacian matrix , eigenvalues and eigenvectors , tree (set theory) , path (computing) , discrete mathematics , graph , computer science , mathematical analysis , physics , quantum mechanics , programming language
Abstract In this article, we study problems where one has to prove that certain graph parameter attains its maximum at the star and its minimum at the path among the trees on a fixed number of vertices. We give many applications of the so‐called generalized tree shift which seems to be a powerful tool to attack the problems of the above‐mentioned kind. We show that the generalized tree shift increases the largest eigenvalue of the adjacency matrix and Laplacian matrix, decreases the coefficients of the characteristic polynomials of these matrices in absolute value. We will prove similar theorems for the independence polynomial and the edge cover polynomial. The generalized tree shift induces a partially ordered set on trees having fixed number of vertices. The smallest element of this poset is the path, largest element is the star. Hence, the above‐mentioned results imply the extremality of the path and the star for these parameters.