✦ LIBER ✦

On cubic polyhedral graphs with prescribed adjacency properties of their faces

✍ Scribed by Peter Smutný; Michal Tkáč

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 433 KB
Volume: 191
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00107-1

No coin nor oath required. For personal study only.

✦ Synopsis

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 cyclically 5-edge-connected non-Hamiltonian members from this class are presented.

📜 SIMILAR VOLUMES

On the average Steiner distance of graph

On the average Steiner distance of graphs with prescribed properties

✍ Peter Dankelmann; Henda C. Swart; Ortrud R. Oellermann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 703 KB

The average n-distance of a connected graph G, p,,(G), is the average of the Steiner distances of all n-sets of vertices of G. In this paper, we give bounds on pn for two-connected graphs and for k-chromatic graphs. Moreover, we show that pn(G) does not depend on the n-diameter of G.