AbstractIt is shown that the distribution of the number of regions r in the random orientable embedding of the graph with one vertex and q loops is approximately proportional to the unsigned Stirling numbers of the first kind s(2q,r) where r has different parity from q. This approximation is strong enough to imply that both the limiting mean and variance of this distribution differ from ln 2q by small known constants. The paper concludes with a result on the unimodality of some recursively defined sequences and also some conjectures regarding region distributions of arbitrary graphs
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of ...
We are interested in $2$-cell embeddings of graphs on orientable surfaces. The distribution of genus...
The genus distribution of a graph G is defined to be the sequence {gm} such that gm is the number of...
AbstractIt is shown that the distribution of the number of regions r in the random orientable embedd...
AbstractLet G be a graph with a vertex u such that V(G) − {u} induces either a forest or a cycle. It...
AbstractSome previously investigated infinite families of cubic graphs have the property that the av...
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...
AbstractFor any fixed graph H, and H-linear family of graphs is a sequence {Gn}n=1∞ of graphs in whi...
AbstractThe concept of genus distribution of graphs is generalized to include nonorientable imbeddin...
AbstractA probabilistic argument is used to obtain an upper bound on the mean of the region distribu...
We describe a general approach of determining the distribution of spanning subgraphs in the random g...
A random 2-cell embedding of a connected graph $G$ in some orientable surface is obtained by choosin...
AbstractThe genus distribution of a graph G is defined to be the sequence {gm} such that gm is the n...
We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved...
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of ...
We are interested in $2$-cell embeddings of graphs on orientable surfaces. The distribution of genus...
The genus distribution of a graph G is defined to be the sequence {gm} such that gm is the number of...
AbstractIt is shown that the distribution of the number of regions r in the random orientable embedd...
AbstractLet G be a graph with a vertex u such that V(G) − {u} induces either a forest or a cycle. It...
AbstractSome previously investigated infinite families of cubic graphs have the property that the av...
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...
AbstractFor any fixed graph H, and H-linear family of graphs is a sequence {Gn}n=1∞ of graphs in whi...
AbstractThe concept of genus distribution of graphs is generalized to include nonorientable imbeddin...
AbstractA probabilistic argument is used to obtain an upper bound on the mean of the region distribu...
We describe a general approach of determining the distribution of spanning subgraphs in the random g...
A random 2-cell embedding of a connected graph $G$ in some orientable surface is obtained by choosin...
AbstractThe genus distribution of a graph G is defined to be the sequence {gm} such that gm is the n...
We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved...
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of ...
We are interested in $2$-cell embeddings of graphs on orientable surfaces. The distribution of genus...
The genus distribution of a graph G is defined to be the sequence {gm} such that gm is the number of...