Three main tools to study graphs mathematically are to make use of the vertex degrees, distances and matrices. The classical graph energy was defined by means of the adjacency matrix in 1978 by Gutman and has a large number of applications in chemistry, physics and related areas. As a result of its importance and numerous applications, several modifications of the notion of energy have been introduced since then. Most of them are defined by means of graph matrices constructed by vertex degrees. In this paper we define another type of energy called q -distance energy by means of distances and matrices. We study some fundamental properties and also establish some upper and lower bounds for this new energy type.
Let G be a simple connected graph having vertex set V and edge set E. The vertex-set and edge-set of G denoted by V(G) and E(G), respectively. The length of the smallest path between vertices u,v V(G) is called the distance, d(u,v), between the vertices u,v. Mathematical chemistry is the area of research engaged in new application of mathematics in chemistry. In mathematics chemistry, we have many topological indices for any molecular graph, that they are invariant on the graph automorphism. In this research paper, we computing the Wiener index and the Hosoya polynomial of the Jahangir graphs J 5,m for all integer number m ≥3. The Wiener index is the sum of distances between all pairs of vertices of G as W(G)= And the Hosoya polynomial of G is H(G,x)= , where d(u,v) denotes the distance between vertices u and v.
27 December 2013 in International Journal of Pure and Apllied Mathematics
Drugs and chemical compounds are often modeled as graphs in which the each vertex of the graph expresses an atom of molecule and covalent bounds between atoms are represented by the edges between their corresponding vertices. The topological indicators defined over this molecular graph have been shown to be strongly correlated to various chemical properties of the compounds. In this article, by means of graph structure analysis, we determine several distance based topological indices of friendship graph [Formula: see text] which is widely appeared in various classes of new nanomaterials, drugs and chemical compounds.
25 September 2016 in Advances in Physical Chemistry
We present explicit formula for the general Randić connectivity, general sum-connectivity, Hyper-Zagreb and Harmonic Indices, and Harmonic polynomial of some simple connected molecular graphs.