AbstractA probabilistic argument is used to obtain an upper bound on the mean of the region distribution of an arbitrary graph. This result, which is fairly sharp, though in all likelihood not best possible, is strong enough to imply that the average genus of the complete graph is asymptotic, in ratio, to its maximum genus
AbstractFor any fixed graph H, and H-linear family of graphs is a sequence {Gn}n=1∞ of graphs in whi...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
We are interested in the distribution of number of faces across all the $2-$cell embeddings of a gra...
AbstractA probabilistic argument is used to obtain an upper bound on the mean of the region distribu...
Not all rational numbers are possibilities for the average genus of an individual graph. The smalles...
We are interested in $2$-cell embeddings of graphs on orientable surfaces. The distribution of genus...
AbstractIt is shown that the distribution of the number of regions r in the random orientable embedd...
AbstractLet Gn be the genus of a two-dimensional surface obtained by gluing, uniformly at random, th...
Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of gen...
Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of gen...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
Any finite graph can be embedded on a surface with sufficiently high genus. Such an embedding can be...
AbstractSome previously investigated infinite families of cubic graphs have the property that the av...
Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous r...
AbstractFor any fixed graph H, and H-linear family of graphs is a sequence {Gn}n=1∞ of graphs in whi...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
We are interested in the distribution of number of faces across all the $2-$cell embeddings of a gra...
AbstractA probabilistic argument is used to obtain an upper bound on the mean of the region distribu...
Not all rational numbers are possibilities for the average genus of an individual graph. The smalles...
We are interested in $2$-cell embeddings of graphs on orientable surfaces. The distribution of genus...
AbstractIt is shown that the distribution of the number of regions r in the random orientable embedd...
AbstractLet Gn be the genus of a two-dimensional surface obtained by gluing, uniformly at random, th...
Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of gen...
Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of gen...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
Any finite graph can be embedded on a surface with sufficiently high genus. Such an embedding can be...
AbstractSome previously investigated infinite families of cubic graphs have the property that the av...
Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous r...
AbstractFor any fixed graph H, and H-linear family of graphs is a sequence {Gn}n=1∞ of graphs in whi...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
We are interested in the distribution of number of faces across all the $2-$cell embeddings of a gra...
DOI
Add to ORKG