A note on heat kernel estimates on weighted graphs with two-sided bounds on the weights.
Schmidt, Andreas U. (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The spread of the potential on a weighted graph.”
A note on heat kernel estimates on weighted graphs with two-sided bounds on the weights.
Coverings, heat kernels and spanning trees.
Chung, Fan, Yau, S.-T. (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The depression of a graph and k-kernels
Mark Schurch, Christine Mynhardt (2014)
Discussiones Mathematicae Graph Theory
Similarity:
An edge ordering of a graph G is an injection f : E(G) → R, the set of real numbers. A path in G for which the edge ordering f increases along its edge sequence is called an f-ascent ; an f-ascent is maximal if it is not contained in a longer f-ascent. The depression of G is the smallest integer k such that any edge ordering f has a maximal f-ascent of length at most k. A k-kernel of a graph G is a set of vertices U ⊆ V (G) such that for any edge ordering f of G there exists a maximal...
Even circuits of prescribed clockwise parity.
Fischer, Ilse, Little, C.H.C. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Decomposition of a Tree into the Minimal Number of Paths
Anton Kotzig (1967)
Matematický časopis
Similarity:
A remark on signed posets and signed graphs
Bohdan Zelinka (1988)
Czechoslovak Mathematical Journal
Similarity:
Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture.
Lovász, László (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some graphic uses of an even number of odd nodes
Kathie Cameron, Jack Edmonds (1999)
Annales de l'institut Fourier
Similarity:
Vertex-degree parity in large implicit “exchange graphs” implies some EP theorems asserting the existence of a second object without evidently providing a polytime algorithm for finding a second object.