A simple connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we find: (1) the greatest number of edges of a highly irregular graph with n vertices, where n is an odd integer (for n even this number is given in [1]), (2) the sm
Polyhedral Graphs with Extreme Numbers of Types of Faces
โ Scribed by Hansjoachim Walther
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 63 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We consider classes of cubic polyhedral graphs whose non-q-gonal faces are adjacent to qgonal faces only. Structural properties of some classes of such graphs are described. For q 5 we show that all the graphs in this class are cyclically 4-edge-connected. Some cyclically 4edge-connected and cyclica
We construct a small non-Hamiltonian 3-connected trivalent planar graph whose faces are all 4-gons or 7-gons and show that the shortness coefficient of the class of such graphs is less than one. Then, by transforming non-Hamiltonian trivalent graphs into regular graphs of valency four or five, we ob