Answers are grounded in this paper and cite their sources.
Given a graph G, many of its topological descriptors have the additive form Dp(G) = i c p i , where the cis are positive parameters associated with G, and p is an arbitrary real number. Sometimes these expressions are generalizations of descriptors with the simpler form D(G) = i ci. It is shown how Radon's inequality and its refinements can be used to find a variety of bounds among members of these families of generalized descriptors. The particular case of sums of powers of normalized Laplacian eigenvalues is thoroughly discussed.
No takes yet. Share an insight, caveat, or question.
José Luis Palacios (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: