For a finite connected graph with the boundary set ∂G from [57], the paper proves analogues of Pólya's hitting-time bound, Faber-Krahn, Hardy, Alexandrov-Bakelman-Pucci, hot spots stability, and Björck's theorem.
Steinerberger, The Boundary of a Graph and its Isoperimetric Inequality, Discrete Applied Mathematics 338 (2023), p
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.CA 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Potential Theory and the Boundary of Combinatorial Graphs
For a finite connected graph with the boundary set ∂G from [57], the paper proves analogues of Pólya's hitting-time bound, Faber-Krahn, Hardy, Alexandrov-Bakelman-Pucci, hot spots stability, and Björck's theorem.