𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A canonical representation of trivalent hamiltonian graphs

✍ Scribed by Roberto Frucht

Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
477 KB
Volume
1
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A canonical representation of trivalent hamiltonian graphs in the form of β€œspan lists” had been proposed by J. Lederberg. It is here presented in a modified form due to H. S. M. Coxeter and the author, and therefore called β€œLCF notation.” This notation has the advantage of being more concise than Lederberg's original span lists whenever the graph has a hamiltonian circuit with rotational symmetry. It is also useful as a method for a systematic classification of trivalent hamiltonian graphs and allows one to define for such graphs two interesting properties, called, respectively, β€œantipalindromic” and β€œquasiantipalindromic.”.

πŸ“œ SIMILAR VOLUMES

A trivalent graph of girth ten
A trivalent graph of girth ten
✍ A.T Balaban πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 249 KB
On a canonical representation of fuzzy n
On a canonical representation of fuzzy numbers
✍ M. Delgado; M.A. Vila; W. Voxman πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 801 KB

Fuzzy numbers, and more generally linguistic values, are approximate assessments, given by experts and accepted by decision-makers when obtaining more accurate values is impossible or unnecessary. To simplify the task of representing and handling fuzzy numbers, several authors have introduced real i

A new 3D representation of trivalent Cay
A new 3D representation of trivalent Cayley networks
✍ Tiziana Calamoneri; Rossella Petreschi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 453 KB

In this paper we deal with trivalent Cayley interconnection networks and we introduce a new representation of them emphasizing their geometric characteristics. Looking inside this model, a new shortest routing algorithm is derived. @ 1997 Elsevier Science B.V.

On the hamiltonian path graph of a graph
On the hamiltonian path graph of a graph
✍ George R. T. Hendry πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 491 KB πŸ‘ 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap