𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian tournaments with the least number of 3-cycles

✍ Scribed by M. Burzio; D. C. Demaria

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
416 KB
Volume
14
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We characterize the family of hamiltonian tournaments with the least number of 3‐cycles, studying their structure and their score sequence. Furthermore, we obtain the number of nonisomorphic tournaments of this family.

πŸ“œ SIMILAR VOLUMES

The number of tournaments with a unique
The number of tournaments with a unique spanning cycle
✍ J. W. Moon πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 312 KB πŸ‘ 1 views

## Abstract The number of tournaments __T~n~__ on __n__ nodes with a unique spanning cycle is the (2__n__‐6)th Fibonacci number when __n__ β‰₯ 4. Another proof of this result is given based on a recursive construction of these tournaments.

On the number of Hamiltonian cycles in t
On the number of Hamiltonian cycles in triangulations
✍ Jan Kratochvil; Dainis Zeps πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 185 KB πŸ‘ 2 views

It is proved that if a planar triangulation different from K3 and K4 contains a Hamiltonian cycle, then it contains at least four of them. Together with the result of Hakimi, Schmeichel, and Thomassen [21, this yields that, for n 2 12, the minimum number of Hamiltonian cycles in a Hamiltonian planar

On the number of hamiltonian cycles in a
On the number of hamiltonian cycles in a maximal planar graph
✍ S. L. Hakimi; E. F. Schmeichel; C. Thomassen πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 243 KB πŸ‘ 2 views

## Abstract We consider the problem of the minimum number of Hamiltonian cycles that could be present in a Hamiltonian maximal planar graph on __p__ vertices. In particular, we construct a __p__‐vertex maximal planar graph containing exactly four Hamiltonian cycles for every __p__ β‰₯ 12. We also pro

Graphs with given odd sets and the least
Graphs with given odd sets and the least number of vertices
✍ Louis Hakimi, S. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 64 KB πŸ‘ 1 views

This note presents a solution to the following problem posed by Chen, Schelp, and SoltΓ©s: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.

Change of the mechanical properties of t
Change of the mechanical properties of two different balloon catheters with increasing numbers of cycles of resterilization
✍ Martin Unverdorben; RenΓ© Quaden; Christian Werner; Peter Bloss; Ralf Degenhardt; πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 123 KB πŸ‘ 1 views

## Abstract An increasing number of centers are reusing PTCA catheters even though manufacturers warrant single use only. This prospective bench laboratory trial addresses the quality of PTCA balloon catheters after up to three resterilization cycles in order to determine whether a larger trial is