نتایج جستجو برای: 4 sum connectivity index
تعداد نتایج: 1761546 فیلتر نتایج به سال:
A topological index is a function having set of graphs as its domain and real numbers range. Here we concentrated on indices involving the number vertices, edges maximum minimum vertex degree. The aim this paper to compute lower upper bounds second Zagreb index, third Hyper Harmonic Redefined first First reformulated Forgotten square F-index, Sum-connectivity Randic Reciprocal Gourava Sombar Ni...
The generalized atom-bond connectivity index of a graph G is denoted by ABCa(G) and defined as the sum of weights ((d(u)+d(v)-2)/d(u)d(v))aa$ over all edges uv∊G. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, we compute sharp bounds for ABCa index for cacti of order $n$ ...
This paper surveys extremal properties of general sum-connectivity index χα(G) in several classes of connected graphs of given order for some values of the parameter α: a) trees; b) connected unicyclic or bicyclic graphs; c) graphs of given connectivity. Work presented as invited lecture at CAIM 2014, September 19-22, “Vasile Alecsandri” University of Bacău, Romania.
eccentric connectivity index has been found to have a low degeneracy and hence a significantpotential of predicting biological activity of certain classes of chemical compounds. wepresent here explicit formulas for eccentric connectivity index of various families of graphs.we also show that the eccentric connectivity index grows at most polynomially with thenumber of vertices and determine the ...
For a given graph G, ε(v) and deg(v) denote the eccentricity and the degree of the vertex v in G, respectively. The adjacent eccentric distance sum index of a graph G is defined as [Formula in text], where [Formula in text] is the sum of all distances from the vertex v. In this paper we derive some bounds for the adjacent eccentric distance sum index in terms of some graph parameters, such as i...
*Correspondence: [email protected] 1School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Sector H-12, Islamabad, Pakistan 2Department of Mathematical Sciences, United Arab Emirates University, P.O. Box 15551, Al Ain, United Arab Emirates Full list of author information is available at the end of the article Abstract Let G be a connected graph. The degree of...
Abstract We consider two recent conjectures made by Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index exclusive number of graphs. One conjecture posits an exact relationship first invariants; we show that in fact predicted value may be arbitrarily far from truth either direction. In process establish some new bounds on both...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید