Schur convex functions on the spectra of graphs

DOI10.1016/0012-365X(83)90034-1zbMath0527.05050MaRDI QIDQ595684

Gregory M. Constantine

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

number of spanning treesSchur-convex functiongraph spectrumgraph eigenvalueKirchhoff matrix

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (19)

The Schur multiplicative and harmonic convexities of the complete symmetric function ⋮ Graph complexity and the laplacian matrix in blocked experiments ⋮ Some properties of a class of symmetric functions and its applications ⋮ Schur convexity for the ratios of the Hamy and generalized Hamy symmetric functions ⋮ Schur convexity for two classes of symmetric functions and their applications ⋮ The Schur multiplicative and harmonic convexities for three classes of symmetric functions ⋮ Ordering trees by algebraic connectivity ⋮ Some properties for a class of symmetric functions with applications ⋮ Schur-convexity for a class of symmetric functions and its applications ⋮ On Schur convexity of some symmetric functions ⋮ Schur convexity for a class of symmetric functions ⋮ Further results on permanental bounds for the Laplacian matrix of trees ⋮ Convexity of the integral arithmetic mean of a convex function ⋮ Coalescence, majorization, edge valuations and the laplacian spectra of graphs ⋮ The Schur harmonic convexity of the Hamy symmetric function and its applications ⋮ Characteristic vertices of trees^* ⋮ Characteristic vertices of trees^* ⋮ Solution of an open problem for Schur convexity or concavity of the Gini mean values ⋮ Laplacian matrices of graphs: A survey

Cites Work

• Unnamed Item
• Comparison of graphs by their number of spanning trees
• A certain polynomial of a graph and graphs with an extremal number of trees
• Inequalities: theory of majorization and its applications
• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees

This page was built for publication: Schur convex functions on the spectra of graphs