Stationary random graphs on with prescribed iid degrees and finite mean connections.
Deijfen, Maria, Jonasson, Johan (2006)
Electronic Communications in Probability [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Tight bounds for quasirandom rumor spreading.”
Stationary random graphs on with prescribed iid degrees and finite mean connections.
A note on the component structure in random intersection graphs with tunable clustering.
Lagerås, Andreas N., Lindholm, Mathias (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The largest component in an inhomogeneous random intersection graph with clustering.
Bloznelis, Mindaugas (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Minimal size of a graph with diameter 2 and given maximal degree. II.
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Neighbourhood tournaments
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
On the number of cut-vertices in a graph.
Hopkins, Glenn, Staton, William (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Even kernels.
Fraenkel, Aviezri (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Random matching problems on the complete graph.
Wästlund, Johan (2008)
Electronic Communications in Probability [electronic only]
Similarity:
Component evolution in random intersection graphs.
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Total vertex irregularity strength of disjoint union of Helm graphs
Ali Ahmad, E.T. Baskoro, M. Imran (2012)
Discussiones Mathematicae Graph Theory
Similarity:
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1,2,...,k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x. The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G. We...
Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.
Chen, Hon-Chan (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity: