The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Let G be a simple graph with vertex set V(G) and edge set E(G). For ∀νi∈V(G), di denotes the degree of νiin G. The Randić connectivity index of the graph G is defined as [1-3] χ(G)= The sum-connectivity index is defined as X(G)= The sum-connectivity index is a new variant of the famous Randić connectivity index usable in quantitative structure-property relationship and quantitative structure-activity...
Let G = (V,E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V(G) and E = E(G), respectively. There exist many topological indices and connectivity indices in graph theory. The First and Second Zagreb indices were first introduced by Gutman and Trinajstić in 1972. It is reported that these indices are useful in the study of anti-inflammatory activities of certain...
The m-connectivety and m-sum connectivity indices of G are defined as to be [wzór] and [wzór] where [wzór] runs over all paths of length m in G and di is the degree of vertex νi. In this paper, we give explicit formulas for the second-connectivity and second-sum-connectivity indices of an infinite class of Armchair Polyhex Nanotubes TUAC6[m,n].
Let G be a molecular graph, a topological index is a numeric quantity related to G which is invariant under graph automorphisms. The eccentric connectivity index ξ(G) is defined as [wzór] where [wzór] denote the degree of vertex v in G and the largest distance between v and any other vertex u of G. The connective eccentric index of graph G is defined as [wzór] In the present paper we compute the connective...
Let G be a simple connected graph with the vertex set V = V(G) and the edge set E = E(G), without loops and multiple edges. For counting qoc strips in G, Omega polynomial was introduced by Diudea and was defined as Ω(G,x ) = [wzór] where m(G,c) be the number of qoc strips of length c in the graph G. Following Omega polynomial, the Sadhana polynomial was defined by Ashrafi et al as Sd(G,x) = [wzór]...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.