On the spectral moment of graphs with given clique number

DOI10.1216/RMJ-2016-46-1-261MaRDI QIDQ289719zbMATH OpenOpenAlexFDO

Authors 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, https://projecteuclid.org/euclid.rmjm/1464035862

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)

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.

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 DE number 5847240

Cites work

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

Cited in

(4)

• Ordering starlike trees by the totality of their spectral moments
• Spectral moments sequence and lexicographical order of graphs
• Complete subgraphs in connected graphs and its application to spectral moment
• 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)