Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...

In supersymmetric models the lightest Higgs boson may decay with a sizable branching ratio into a pair of light neutralinos. We analyze such decays within the context of the minimal supersymmetric standard model with R-parity violation, where the neutralino itself is unstable and decays into Standard Model fermions. We show that the R-parity violating couplings induce novel Higgs decay signals ...

We propose a method for upper bounding the general adversary bound for certain boolean functions. Due to the the tightness of query complexity and the general adversary bound [5], this gives an upper bound on the quantum query complexity of those functions. We give an example where this upper bound is smaller than the query complexity of any known quantum algorithm.

In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores