𝔖 Bobbio Scriptorium
✦   LIBER   ✦

EXTREMAL PROBLEMS FOR GRAPHS WITH DIHEDRAL AUTOMORPHISM GROUP

✍ Scribed by Donald J. McCarthy

Book ID
118717676
Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
526 KB
Volume
319
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs with symmetric automorphism group
Graphs with symmetric automorphism group
✍ W. D. Wallis; Katherine Heinrich πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 333 KB

## Abstract We investigate the properties of graphs whose automorphism group is the symmetric group. In particular, we characterize graphs on less than 2__n__ points with group __S~n~__, and construct all graphs on __n__ + 3 points with group __S~n~__. Graphs with 2__n__ or more points and group __

Extremal problems for directed graphs
Extremal problems for directed graphs
✍ W.G Brown; P ErdΓΆs; M Simonovits πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 858 KB
Exceptional trivalent cayley graphs for
Exceptional trivalent cayley graphs for dihedral groups
✍ David L. Powers πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 432 KB

## Abstract If __n__ is divisible by at least three distinct primes, the dihedral group __D~n~__ can be generated by three nonredundant, involuntary elements. We study the Cayley graphs resulting from such a presentation of __D~n~__ for several families of __n__ and for all admissible __n__ < 120.

An intermediate value theorem for graphs
An intermediate value theorem for graphs with given automorphism group
✍ Pavol Hell; Louis V. Quintas πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 312 KB

## Abstract For a positive integer __n__ and a finite group __G__, let the symbols __e__(__G, n__) and __E__(__G, n__) denote, respectively, the smallest and the greatest number of lines among all __n__‐point graphs with automorphism group __G__. We say that the Intermediate Value Theorem (IVT) hol