Concentration of the Kirchhoff index for Erdős–Rényi graphs
نویسندگان
چکیده
منابع مشابه
Concentration of the Kirchhoff index for Erdős-Rényi graphs
Given an undirected graph, the resistance distance between two nodes is the resistance one would measure between these two nodes in an electrical network if edges were resistors. Summing these distances over all pairs of nodes yields the so-called Kirchhoff index of the graph, which measures its overall connectivity. In this work, we consider Erdős-Rényi random graphs. Since the graphs are rand...
متن کاملKirchhoff index of composite graphs
Let G 1 + G 2 , G 1 • G 2 and G 1 {G 2 } be the join, corona and cluster of graphs G 1 and G 2 , respectively. In this paper, Kirchhoff index formulae of these composite graphs are given.
متن کاملnote on degree kirchhoff index of graphs
the degree kirchhoff index of a connected graph $g$ is defined as the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices, where $d_i$ is the degree of the $i$-th vertex, and $r_{ij}$ the resistance distance between the $i$-th and $j$-th vertex of $g$. bounds for the degree kirchhoff index of the line and para-line graphs are determined. the special case of regular grap...
متن کاملOn the Kirchhoff Index of Graphs
Let G be a connected graph of order n with Laplacian eigenvalues μ1 ≥ μ2 ≥ . . .≥ μn−1 > μn = 0. The Kirchhoff index of G is defined as Kf = Kf(G) = n∑n−1 k=1 1/μk. In this paper. we give lower and upper bounds on Kf of graphs in terms on n, number of edges, maximum degree, and number of spanning trees. Moreover, we present lower and upper bounds on the Nordhaus–Gaddum-type result for the Kirch...
متن کاملBounds for the Kirchhoff Index of Bipartite Graphs
A m,n -bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has n vertices. The tree dumbbell D n, a, b consists of the path Pn−a−b together with a independent vertices adjacent to one pendent vertex of Pn−a−b and b independent vertices adjacent to the other pendent vertex of Pn−a−b. In this paper, firstly, we show that, among m,n bipartite gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 2014
ISSN: 0167-6911
DOI: 10.1016/j.sysconle.2014.10.006