Combinatorial Green's function of a graph and applications to networks

DOI10.1016/j.aam.2010.10.006zbMath1222.05162OpenAlexW2018692741MaRDI QIDQ534204

Woong Kook

Publication date: 17 May 2011

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2010.10.006

zbMATH Keywords

Laplacian matrix of a graphresistor networkcontraction of a weighted graphtree number

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (8)

Electrical Properties of an m × n Hammock Network* ⋮ Simplicial networks and effective resistance ⋮ Resistance distance in tensor and strong product of path or cycle graphs based on the generalized inverse approach ⋮ Logarithmic tree-numbers for acyclic complexes ⋮ Path Laplacian matrices: introduction and application to the analysis of consensus in networks ⋮ Path intersection matrices and applications to networks ⋮ Kirchhoff index of simplicial networks ⋮ High-dimensional networks and spanning forests

Cites Work

• Resistances and currents in infinite electrical networks
• Theory of resistor networks: the two-point resistance
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial Green's function of a graph and applications to networks