نتایج جستجو برای: general sum connectivity index
تعداد نتایج: 1209010 فیلتر نتایج به سال:
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$ ...
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 graph G, let σ(G) = ∑ uv∈E(G) 1 √ dG(u)+dG(v) ; this defines the sum-connectivity index σ(G). More generally, given a positive function t, the edge-weight t-index t(G) is given by t(G) = ∑ uv∈E(G) t(ω(uv)), where ω(uv) = dG(u) + dG(v). We consider extremal problems for the t-index over various families of graphs. The sum-connectivity index satisfies the conditions imposed on t in each ext...
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...
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...
We consider $2$-colourings $f : E(G) \rightarrow \{ -1 ,1 \}$ of the edges a graph $G$ with colours $-1$ and $1$ in $\mathbb{Z}$. A subgraph $H$ is said to be zero-sum under $f$ if $f(H) := \sum_{e\in E(H)} f(e) =0$. study following type questions, several cases obtaining best possible results: Under which conditions on $|f(G)|$ can we guarantee existence spanning tree $G$? The types are comple...
The graphs having the maximum value of certain bond incident degree indices (including second Zagreb index, general sum-connectivity and zeroth-order Randi? index) in class all connected with fixed order number pendent vertices are characterized this paper. problem finding minimum values index from aforementioned is also addressed. One obtained results about first has already been proved papers...
let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.
In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید