๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Point-color-symmetric graphs with a prime number of vertices

โœ Scribed by Hong Zhang

Publisher
Springer Japan
Year
1990
Tongue
English
Weight
434 KB
Volume
6
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Primitive symmetric designs with prime p
Primitive symmetric designs with prime power number of points
โœ Snjeลพana Braiฤ‡; Anka Golemac; Joลกko Mandiฤ‡; Tanja Vuฤiฤiฤ‡ ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 142 KB

## Abstract In this paper we either prove the nonโ€existence or give explicit construction of primitive symmetric (__v, k__, __ฮป__) designs with __v__=__p__^__m__^<2500, __p__ prime and __m__>1. The method of design construction is based on an automorphism group action; nonโ€existence results additio

On labeled vertex-transitive digraphs wi
On labeled vertex-transitive digraphs with a prime number of vertices
โœ Chong-Yun Chao; Jacqueline G. Wells ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 481 KB

## We enumerate, up to isomorphism, several classes of labeled vertex-transitive digraphs with a prime number of vertices. There are many unsolvedi enumeration problems stated in [S]. Recently, Robinson in [8] posed more enumeration problems. Here, we give some partial answer to the problems posed

Graphs embedded in the plane with a boun
Graphs embedded in the plane with a bounded number of accumulation points
โœ C. Paul Bonnington; R. Bruce Richter ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 138 KB ๐Ÿ‘ 1 views

## Abstract Halin's Theorem characterizes those infinite connected graphs that have an embedding in the plane with no accumulation points, by exhibiting the list of excluded subgraphs. We generalize this by obtaining a similar characterization of which infinite connected graphs have an embedding in