Results 241 to 250 of about 198,105 (266)
Some of the next articles are maybe not open access.
Journal of Graph Theory, 1982
AbstractThis paper presents a review of results dealing with structural properties and numerical characteristics of random edge‐subgraphs of complete graphs, with the connectedness of random graphs, as well as with random trees and forests.
openaire +2 more sources
AbstractThis paper presents a review of results dealing with structural properties and numerical characteristics of random edge‐subgraphs of complete graphs, with the connectedness of random graphs, as well as with random trees and forests.
openaire +2 more sources
Combinatorica, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Random trees in a graph and trees in a random graph
Mathematical Proceedings of the Cambridge Philosophical Society, 1986This paper treats two related sets of problems in the theory of random graphs. In Sections 2 and 3 we study random spanning subtrees of a complete graph (or, equivalently, random labelled trees). It is shown that the number of common edges of two such random trees asymptotically has a Poisson distribution with expectation 2.
openaire +1 more source
Journal of Symbolic Logic, 1991
Let Γ be the unique (up to isomorphism) countable graph with the following property: (*) Given any two finite disjoint subsets U and V of Γ, there exists a vertex z ∈ Γ joined to every vertex in U and to none in V.Thus Γ is the countable, universal, homogeneous graph; also known as the random graph. In this paper, we shall study the reducts of Γ Here a
openaire +2 more sources
Let Γ be the unique (up to isomorphism) countable graph with the following property: (*) Given any two finite disjoint subsets U and V of Γ, there exists a vertex z ∈ Γ joined to every vertex in U and to none in V.Thus Γ is the countable, universal, homogeneous graph; also known as the random graph. In this paper, we shall study the reducts of Γ Here a
openaire +2 more sources
Localization and Universality of Eigenvectors in Directed Random Graphs
Physical Review Letters, 2021Fernando L Metz, Izaak Neri
exaly
Complete Graphs and Bipartite Graphs in a Random Graph
2021 5th International Conference on Vision, Image and Signal Processing (ICVISP), 2021Lijin Feng, Jackson Barr
openaire +1 more source
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006
openaire +2 more sources
openaire +2 more sources
Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1985Andrew K C Wong
exaly