the emph{harary index} $h(g)$ of a connected graph $g$ is defined as $h(g)=sum_{u,vin v(g)}frac{1}{d_g(u,v)}$ where $d_g(u,v)$ is the distance between vertices $u$ and $v$ of $g$. the steiner distance in a graph, introduced by chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. for a connected graph $g$ of order at least $2$ and $ssubseteq v(g)$, th...

The degree distance of a graph G is     , 1 1 1 2 n n i j i i j D G d d L        j , where and i d j d are the degrees of vertices , and is the distance between them. The Wiener index is defined as   , i j v v V G  , i j L   , 1 1 1 2 n n i j i j W G L      . An elegant result (Gutman; Klein, Mihalić,, Plavšić and Trinajstić) is known regarding their correlation, that   ...

Given a complex m n matrix A; we index its singular values as 1 (A) 2 (A) ::: and call the value E (A) = 1 (A)+ 2 (A)+ ::: the energy of A; thereby extending the concept of graph energy, introduced by Gutman. Koolen and Moulton proved that E (G) (n=2) (1 + p n) for any graph G of order n and exhibited an in…nite family of graphs with E (G) = (v (G) =2) 1 + p v (G) . We prove that for all su¢ ci...

Delineation of aquatic plants and estimation of its surface extent are crucial to the efficient control of its proliferation, and this information can be derived accurately with fine resolution remote sensing products. However, small swath and low observation frequency associated with them may be prohibitive for application to large water bodies with rapid proliferation and dynamic floating aqu...

Many tissues contain enzymes which will hydrolyse the organic phosphorus compounds to give free phosphoric acid. These enzymes are known as phosphatases. Some of these phosphatases are most active in an alkaline medium and the others in an acid medium. The phosphatase of bone (Yamane, 1931), bile (King and Armstrong, 1934) and white blood cells (Roche, 1931) are alkaline phosphatases, while tho...

The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...

The atom-bond connectivity (ABC) index is one of the most investigated degreebased molecular structure descriptors with a variety of chemical applications. It is known that among all connected graphs, the trees minimize the ABC index. However, a full characterization of trees with a minimal ABC index is still an open problem. By now, one of the proved properties is that a tree with a minimal AB...

I. Gutman, J. H. Koolen, V. Moulton, M. Parac, T. Soldatović, and D. Vidović Faculty of Science, University of Kragujevac, P. O. Box 60, YU-34000 Kragujevac, Yugoslavia a FSPM-Strukturbildungsprozesse, University of Bielefeld, D-33501 Bielefeld, Germany b Physics and Mathematics Department (FMI), Mid Sweden University, Sundsvall, S-85170, Sweden c Faculty of Physical Chemistry, University of Be...

D. B. Gutman,1,2 S. Tongay,3 H. K. Pal,3 D. L. Maslov,3 and A. F. Hebard3 1Institut für Theorie der Kondensierten Materie, Universität Karlsruhe, 76128 Karlsruhe, Germany 2DFG–Center for Functional Nanostructures, Universität Karlsruhe, 76128 Karlsruhe, Germany 3Department of Physics, University of Florida, Gainesville, Florida 32611, USA Received 21 March 2009; revised manuscript received 2 Ju...