On the spectral moment of graphs with given clique number

DOI10.1216/RMJ-2016-46-1-261zbMATH Open1337.05074arXiv1209.3455OpenAlexW2963116204MaRDI QIDQ289719FDOQ289719

Authors: Shuchao Li, Shuna Hu 

Publication date: 31 May 2016

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

Abstract: Let $mathscr{L}_{n,t}$ be the set of all $n$-vertex connected graphs with clique number $t$,($2leqtleqn)$. For $n$-vertex connected graphs with given clique number, lexicographic ordering by spectral moments ($S$-order) is discussed in this paper. The first $su{m}_{i=1}^{lfloorfracn-t-13floor}(n-t-3i)+1$ graphs with $3letlen-4$, and the last few graphs, in the $S$-order, among $mathscr{L}_{n,t}$ are characterized. In addition, all graphs in $$ have an $S$-order; for the cases $t=n-2$ and $t=n-3$ the first three and the first seven graphs in the set $mathscr{L}_{n,t}$ are characterized, respectively.

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

Recommendations

• On the spectral moment of graphs with \(k\) cut edges
• Complete subgraphs in connected graphs and its application to spectral moment
• Lexicographical ordering of trees, unicyclic graphs and bicyclic graphs with respect to spectral moments
• scientific article; zbMATH DE number 6940818
• scientific article

zbMATH Keywords

chromatic numberclique numberspectral moment

Mathematics Subject Classification ID

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

Cites Work

• The spectral radius of graphs without paths and cycles of specified length
• Graph theory with applications
• 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
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• Title not available (Why is that?)
• Lexicographical ordering by spectral moments of trees with \(k\) pendant vertices and integer partitions
• On the spectral moments of unicyclic graphs with fixed diameter
• On the lexicographical ordering by spectral moments of bicyclic graphs.
• The spectral moments of trees with given maximum degree
• A generalization of Turán's theorem
• Vector subdivision schemes in \((L_p(\mathbb R^s))^r\) (\(1\leq p\leq\infty\)) spaces
• On the spectral moment of graphs with \(k\) cut edges
• 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

Cited In (4)

• Ordering starlike trees by the totality of their spectral moments
• Complete subgraphs in connected graphs and its application to spectral moment
• Spectral moments sequence and lexicographical order of graphs
• On spectrum of I-graphs and its ordering with respect to spectral moments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289719)