scientific article

From MaRDI portal
Revision as of 04:13, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

zbMath1194.05031MaRDI QIDQ3588556

Ravindra B. Bapat

Publication date: 12 September 2010


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

On relation between the Kirchhoff index and number of spanning trees of graph, Families of metrized graphs with small tau constants, Resistance matrices of balanced directed graphs, Algorithmic techniques for finding resistance distances on structured graphs, On the relationship between the Kirchhoff and the Narumi-Katayama indices, The Braess' paradox for pendent twins, On solving a non-convex quadratic programming problem involving resistance distances in graphs, Simple expressions for the long walk distance, Comparison theorems on resistance distances and Kirchhoff indices of \(S,T\)-isomers, Unnamed Item, Modeling spatial networks by contact graphs of disk packings, Resistance distance and spanning 2-forest matrices of linear 2-trees, The tau constant and the discrete Laplacian matrix of a metrized graph, The walk distances in graphs, On the first passage time of a simple random walk on a tree, Gram matrices of reproducing kernel Hilbert spaces over graphs, Identities for minors of the Laplacian, resistance and distance matrices, Resistance distance in wheels and fans, Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights, A physics perspective on the resistance distance for graphs, The Moore-Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs, Spanning 2-forests and resistance distance in 2-connected graphs, Computation of polarized metrized graph invariants by using discrete Laplacian matrix, Distance matrix and Laplacian of a tree with attached graphs, Resistance distance in directed cactus graphs