نتایج جستجو برای: leap zagreb indices
تعداد نتایج: 88825 فیلتر نتایج به سال:
We obtain inequalities involving many topological indices in classical graph products by using the f-polynomial. In particular, we work with lexicographic product, Cartesian sum and first Zagreb, forgotten, inverse degree lordeg indices.
In this paper, we present sharp bounds for the Zagreb indices, Harary index and hyperWiener index of graphs with a given matching number, and we also completely determine the extremal graphs. © 2010 Elsevier Ltd. All rights reserved.
In this note, we obtain the expressions for multiplicative Zagreb indices and coindices of derived graphs such as a line graph, subdivision graph, vertex-semitotal graph, edge-semitotal graph, total graph and paraline graph.
<abstract><p>In this work we obtain new lower and upper optimal bounds of general Sombor indices. Specifically, get inequalities for these indices relating them with other indices: the first Zagreb index, forgotten index variable index. Finally, solve some extremal problems indices.</p></abstract>
We show how generalized Zagreb indices $M_1^k(G)$ can be computed by using a simple graph polynomial and Stirling numbers of the second kind. In that way we explain and clarify the meaning of a triangle of numbers used to establish the same result in an earlier reference.
In this paper, we compute the formulae for the third Zagreb indices and its coindices for two classes of graphs such as edge corona product graph, double graph and kth iterated double graph.
The forgotten topological coindex (also called Lanzhou index) is defined for a simple connected graph G as the sum of the terms du2+dv2 over all non-adjacent vertex pairs uv of G, where du denotes the degree of the vertex u in G. In this paper, we present some inequalit...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید