Resistance distance in complete \(n\)-partite graphs
From MaRDI portal
Publication:260022
DOI10.1016/j.dam.2015.09.017zbMath1332.05044OpenAlexW2119952796MaRDI QIDQ260022
Publication date: 18 March 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.09.017
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15)
Related Items (30)
On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain ⋮ Resistance between two nodes of a ring network ⋮ A type of generalized mesh-star transformation and applications in electrical networks ⋮ Shapley Distance and Shapley Index for Some Special Graphs ⋮ Resistance distance in tensor and strong product of path or cycle graphs based on the generalized inverse approach ⋮ Kirchhoff index and degree Kirchhoff index of complete multipartite graphs ⋮ Computation of resistance distance and Kirchhoff index of the two classes of silicate networks ⋮ Eigenvalues of the resistance-distance matrix of complete multipartite graphs ⋮ Resistance between two nodes of a ring clique network ⋮ Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron ⋮ Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs ⋮ Resistance distance of generalized wheel and dumbbell graph using symmetric {1}-inverse of Laplacian matrix ⋮ Computation of resistance distance with Kirchhoff index of body centered cubic structure ⋮ Solution to a conjecture on resistance diameter of lexicographic product of paths ⋮ Two-point resistances in the generalized phenylenes ⋮ Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph ⋮ Complete characterization of resistance distance for linear octagonal networks ⋮ Resistance between two vertices of almost complete bipartite graphs ⋮ Effective resistances and spanning trees in the complete bipartite graph plus a matching ⋮ On the resistance diameters of graphs and their line graphs ⋮ Resistance distances in vertex-weighted complete multipartite graphs ⋮ Moore-Penrose inverse of the incidence matrix of a distance regular graph ⋮ Resistances between two nodes of a path network ⋮ Resistance distance of blowups of trees ⋮ Resistance distance in potting networks ⋮ On the resistance diameter of hypercubes ⋮ The Moore-Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs ⋮ Counting spanning trees in almost complete multipartite graphs ⋮ Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index ⋮ Some two-vertex resistances of nested triangle network
Cites Work
This page was built for publication: Resistance distance in complete \(n\)-partite graphs
