Displaying similar documents to “Poisson convergence of numbers of vertices of a given degree in random graphs”

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....

The sizes of components in random circle graphs

Ramin Imany-Nabiyyi (2008)

Discussiones Mathematicae Graph Theory

Similarity:

We study random circle graphs which are generated by throwing n points (vertices) on the circle of unit circumference at random and joining them by an edge if the length of shorter arc between them is less than or equal to a given parameter d. We derive here some exact and asymptotic results on sizes (the numbers of vertices) of "typical" connected components for different ways of sampling them. By studying the joint distribution of the sizes of two components, we "go into" the structure...

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).

Supermagic Generalized Double Graphs 1

Jaroslav Ivančo (2016)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we will introduce some constructions of supermagic labellings of some graphs generalizing double graphs. Inter alia we show that the double graphs of regular Hamiltonian graphs and some circulant graphs are supermagic.

A characterization of complete tripartite degree-magic graphs

Ľudmila Bezegová, Jaroslav Ivančo (2012)

Discussiones Mathematicae Graph Theory

Similarity:

A graph is called degree-magic if it admits a labelling of the edges by integers 1, 2,..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal to (1+ |E(G)|)/2*deg(v). Degree-magic graphs extend supermagic regular graphs. In this paper we characterize complete tripartite degree-magic graphs.