A strong Liouville theorem for -harmonic functions on graphs.
Holopainen, Ilkka, Soardi, Paolo M. (1997)
Annales Academiae Scientiarum Fennicae. Mathematica
Similarity:
Displaying similar documents to “A stability theorem for elliptic Harnack inequalities”
A strong Liouville theorem for -harmonic functions on graphs.
Nowhere continuous solutions to elliptic systems
Oldřich John, Jan Malý, Jana Stará (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Upper bounds on the non-3-colourability threshold of random graphs.
Fountoulakis, Nikolaos, McDiarmid, Colin (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Two results concerning string graphs
Jan Kratochvíl (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Paths of specified length in random -partite graphs.
Subramanian, C.R. (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
A Note On Graphs Representable As Product Graphs
Zlatomir Lukić (1982)
Publications de l'Institut Mathématique
Similarity:
Asymptotic properties of random graphs
Zbigniew Palka
Similarity:
CONTENTS1. Introduction...........................................................................5 1.1. Purpose and scope..........................................................5 1.2. Probability-theoretic preliminaries....................................6 1.3. Graphs............................................................................11 1.4. Random graphs..............................................................132. Vertex-degrees....................................................................15 2.1....
A note on domination parameters in random graphs
Anthony Bonato, Changping Wang (2008)
Discussiones Mathematicae Graph Theory
Similarity:
Domination parameters in random graphs G(n,p), where p is a fixed real number in (0,1), are investigated. We show that with probability tending to 1 as n → ∞, the total and independent domination numbers concentrate on the domination number of G(n,p).
Harnack inequalities on graphs
Thierry Delmotte (1997-1998)
Séminaire de théorie spectrale et géométrie
Similarity:
Union of Distance Magic Graphs
Sylwia Cichacz, Mateusz Nikodem (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant. In this paper, we study unions of distance magic graphs as well as some properties of such graphs.