For a (molecular) graph G, the extended adjacency index E A ( G ) is defined as equation . In this paper we introduce some graph transformations which increase or decrease the extended adjacency ( E A ) index. Also, we obtain the extremal acyclic, unicyclic and bicyclic graphs with minimum and maximum of the E A index by a unified method, respectively.

No abstract

The purpose of this article is to investigate the uniqueness of meromorphic functions sharing a set with counting multiplicity and also with weight 1 in annuli. RESUMENEl propósito de este artículo es investigar la unicidad de funciones meromorfas compartiendo un conjunto contando multiplicidad y también con peso 1 en un anillo.

No abstract

No abstract