𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycle bases of graphs for sparse flexibility matrices

✍ Scribed by A. Kaveh; G.R. Roosta

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
200 KB
Volume
73
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.

✦ Synopsis

An ecient algorithm is presented for the formation of cycle bases of graphs corresponding to sparse cyclemember incidence matrices, leading to the formation of highly sparse Β―exibility matrices. The algorithm presented employs a new expansion process and uses an ecient graph-theoretical method for controlling the independence of the selected cycles.

πŸ“œ SIMILAR VOLUMES

Cycle bases for the flexibility analysis
Cycle bases for the flexibility analysis of structures
✍ A. C. Cassell; J. C. de C. Henderson; A. Kaveh πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 533 KB

## Abstract Two methods are presented for the automatic selection of a cycle basis leading to a sparse flexibility matrix for the analysis of rigid‐jointed skeletal structures. The first method having a local approach forms a maximal set of admissible minimal cycles, while the second having a glob

Minimum Cycle Bases for Network Graphs
Minimum Cycle Bases for Network Graphs
✍ Franziska Berger; Peter Gritzmann; Sven de Vries πŸ“‚ Article πŸ“… 2004 πŸ› Springer 🌐 English βš– 233 KB
Minimum cycle bases of Halin graphs
Minimum cycle bases of Halin graphs
✍ Peter F. Stadler πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 90 KB

## Abstract Halin graphs are planar 3‐connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not β€œnecklaces” have a unique minimum cycle basis. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 150–155, 2003