• Publications
• Influence

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from publisher and metadata sources).
• Mathematics, Computer Science
• Discrete Applied Mathematics
• 20 February 2009
• The Wiener index is the sum of distances between all vertex pairs in a connected graph. This notion was motivated by various mathematical properties and chemical applications. In this paper weContinue Reading
• Mathematics, Computer Science
• Appl. Math. Lett.
• 1 April 2011
• Abstract The ordinary generalized geometric–arithmetic index of graphs is introduced and some properties especially lower and upper bounds in terms of other graph invariants and topological indicesContinue Reading
• Mathematics
• 2008
• Let G be a connected finite undirected graph without loops or multiple edges. Denote the vertex and edge sets of G by V (G) and E(G), respectively. The distance between two vertices u and v of G isContinue Reading
• Mathematics, Computer Science
• Ars Comb.
• 2007
• In a process of preparing 2,2,2-trichloro-1-(N-hydrocarbylpyrryl-2)-ethanol by mixing and reacting essentially equimolar quantities of chloral and N-hydrocarbylpyrrole in a liquid reaction systemContinue Reading
• 1
• Mathematics
• 1 July 2008
• The hyper Wiener index of a connected graph $G$ is defined as $WW(G)=\frac{1}{2}\sum_{\{u,v\}\subseteq V(G)}\bigg(d(u,v)+\frac{1}{2}(d(u,v))^2\bigg)$, where $V(G)$ is the set of all vertices of $G$Continue Reading
• Mathematics
• 2013
• Let G = (V, E) be a simple graph with n = |V | vertices and m = |E| edges. The first and the second Zagreb indices of G are defined as M1(G )= � u∈V d 2 = � uv∈E [du + dv ]a nd M2(G )= � uv∈E du dv,Continue Reading
• Mathematics, Computer Science
• Discrete Applied Mathematics
• 1 June 2012
• We determine the Wiener index of graphs which are constructed by some operations such as Mycielski's construction, generalized hierarchical product and t-th subdivision of graphs.