Hypertrees

Authors
Nieminen, J Peltola, M
Citation
J. Nieminen et M. Peltola, Hypertrees, APPL MATH L, 12(2), 1999, pp. 35-38
Citations number
1
Categorie Soggetti
Mathematics
Journal title
APPLIED MATHEMATICS LETTERS
ISSN journal
08939659 → ACNP
Volume
12
Issue
2
Year of publication
1999
Pages
35 - 38
Database
ISI
SICI code
0893-9659(199903)12:2<35:H>2.0.ZU;2-0
Abstract
A connected hypergraph H has a tree structure, i.e., H is a hypertree, if t he removal of any edge from H results a disconnected hypergraph. The struct ure of hypertrees is described and its cycles are classified. Conditions sa tisfied by the dual and the transversal of hypertrees are defined and the c onformality of hypertrees is described. (C) 1998 Elsevier Science Ltd. All rights reserved.