On the spectral moment of graphs with given clique number

DOI10.1216/RMJ-2016-46-1-261zbMath1337.05074arXiv1209.3455OpenAlexW2963116204MaRDI QIDQ289719

Shuchao Li, Shuna Hu

Publication date: 31 May 2016

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.3455

zbMATH Keywords

chromatic numberclique numberspectral moment

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Ordering starlike trees by the totality of their spectral moments ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• Lexicographical ordering by spectral moments of trees with \(k\) pendant vertices and integer partitions
• On the spectral moments of unicyclic graphs with fixed diameter
• The spectral moments of trees with given maximum degree
• Vector subdivision schemes in \((L_p(\mathbb R^s))^r\) (\(1\leq p\leq\infty\)) spaces
• Lexicographical ordering by spectral moments of trees with a prescribed diameter
• On the spectral moment of quasi-trees
• A table of connected graphs on six vertices
• A contribution to the Zarankiewicz problem
• The spectral radius of graphs without paths and cycles of specified length
• Spectra of unicyclic graphs
• An improved bound on the minimal number of edges in color-critical graphs
• Bounds on graph eigenvalues. II
• Some new results in extremal graph theory
• A Spectral Erdős–Stone–Bollobás Theorem
• A generalization of Turán's theorem
• On the spectral moment of graphs with $k$ cut edges

This page was built for publication: On the spectral moment of graphs with given clique number