On the spectral moment of graphs with given clique number

2012/09/16 by Shuna Hu, Shuchao Li, Hu, Shuna +3 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1209.3455

openalex publication_date 2012/09/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let \mathscrL_n,t be the set of all n-vertex connected graphs with clique number t (2≤ t≤ n). For n-vertex connected graphs with given clique number, lexicographic ordering by spectral moments (S-order) is discussed in this paper. The first ∑_i=1^{\lfloor(n-t-1)/(3)\rfloor}(n-t-3i)+1 graphs with 3≤ t≤ n-4, and the last few graphs, in the S-order, among \mathscrL_n,t are characterized. In addition, all graphs in \mathscrL_n,n\bigcup\mathscrL_n,n-1 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 \mathscrL_n,t are characterized, respectively.

Citations

• On the spectral moment of trees with given degree sequences

Cited by

• Lexicographical ordering by spectral moments of bicyclic hypergraphs

Related

• Lexicographical ordering of hypergraphs via spectral moment
• Lexicographical ordering by spectral moments of bicyclic hypergraphs
• The maximum number of s-cliques in connected graphs and its application to spectral moment
• On the spectral moment of trees with given degree sequences
• On the spectral moment of graphs with k cut edges