Green's function in partial subdivision networks
DOI10.1080/03081087.2018.1499704zbMath1429.05051OpenAlexW2884149408WikidataQ114641444 ScholiaQ114641444MaRDI QIDQ5205782
Enric Monsó, Ángeles Carmona, Margarida Mitjana
Publication date: 16 December 2019
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/126115
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Theory of matrix inversion and generalized inverses (15A09) Deterministic network models in operations research (90B10) Distance in graphs (05C12) Discrete potential theory (31C20) Boundary value problems on graphs and networks for ordinary differential equations (34B45)
Related Items (1)
Cites Work
- Unnamed Item
- Kirchhoff index in line, subdivision and total graphs of a regular graph
- Random walks and the effective resistance sum rules
- Graph spectra in computer science
- Characterization of symmetric \(M\)-matrices as resistive inverses
- The subgraph homeomorphism problem
- Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
- Resistance characterizations of equiarboreal graphs
- Discrete elliptic operators and their Green operators
- The Kirchhoff index of subdivisions of graphs
- Potential theory for Schrödinger operators on finite networks
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Some results on resistance distances and resistance matrices
- Effective resistances and Kirchhoff index in subdivision networks
- Minimizing Effective Resistance of a Graph
This page was built for publication: Green's function in partial subdivision networks