Let G(n,α) be the class of block graphs on n vertices and prescribed independence number α. In this article we prove that the maximum spectral radius ρ(G), among all graphs G∈G(n,α), is reached at a unique graph. As a ...

G = (V (G),E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the unique cycle of G. The graph G − E(Cr ) is a forest of r rooted treesT1,T2, . . .,Tr with root vertices v1, v2, . . ., ...

In this paper, the main microphysical characteristics of clouds developing in polluted and clean conditions in the biomass-burning season of the Amazon region are examined, with special attention to the spectral dispersion ...