نتایج جستجو برای: kirchhoff index
تعداد نتایج: 398443 فیلتر نتایج به سال:
In 1993 two novel distance-based topological indices were put forward. In the case of acyclic molecular graphs both are equal to the Wiener index, but both differ from it if the graphs contain cycles. One index is defined (Mohar, B.; Babić, D.; Trinajstić, N. J. Chem. Inf. Comput. Sci. 1993, 33, 153-154) in terms of eigenvalues of the Laplacian matrix, whereas the other is conceived (Klein, D. ...
the k-th semi total point graph of a graph g, , is a graph obtained from g by adding k vertices corresponding to each edge and connecting them to the endpoints of edge considered. in this paper, a formula for laplacian polynomial of in terms of characteristic and laplacian polynomials of g is computed, where is a connected regular graph.the kirchhoff index of is also computed.
Resistance distance was introduced by Klein and Randić. The Kirchhoff index Kf(G) of a graph G is the sum of resistance distances between all pairs of vertices. A graph G is called a cactus if each block of G is either an edge or a cycle. Denote by Cat(n; t) the set of connected cacti possessing n vertices and t cycles. In this paper, we give the first three smallest Kirchhoff indices among gra...
The resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by replacing each edge with a (unit) resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices in G. For a graph G, let R(G) be the graph obtained from G by adding a new vertex co...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید