In this paper we give mean of $p$-th degree of singular values and upper bound of geometric mean for almost all graphs. We prove three theorems about a conjecture of V. Nikiforov for Schatten $p$-norm of graphs when $p>2$. We prove that the conjecture is true when $p$ is an even integer or when graph is a tree or a strongly regular graph with certain parameters. The strongly regular graphs with these parameters are graphs with maximal energy.
singular values of graph Schatten norms random graph energy of graph
Birincil Dil | İngilizce |
---|---|
Konular | Matematik |
Bölüm | Matematik |
Yazarlar | |
Yayımlanma Tarihi | 1 Haziran 2022 |
Yayımlandığı Sayı | Yıl 2022 Cilt: 51 Sayı: 3 |