๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Decompositions of recognizable strong maximal codes

โœ Scribed by Liang Zhang; Weide Qiu

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
585 KB
Volume
108
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Completion of recognizable bifix codes
Completion of recognizable bifix codes
โœ Zhang Liang; Shen Zhonghui ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 541 KB
Hamiltonian decompositions of strong pro
Hamiltonian decompositions of strong products
โœ Fan, Cong; Liu, Jiuqiang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 286 KB

It is shown that if both G 1 and G 2 are Hamiltonian decomposable, then so is their strong product.

Structure of 3-infix-outfix maximal code
Structure of 3-infix-outfix maximal codes
โœ Dong Yang Long; Ma Jian; Zhou Duanning ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 530 KB
Maximality of the cycle code of a graph
Maximality of the cycle code of a graph
โœ Patrick Solรฉ; Thomas Zaslavsky ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 274 KB

The cycle code of a graph is the binary linear span of the characteristic vectors of circuits. We characterize the graphs whose cycle codes are maximal for the packing problem, based on characterizing the graphs whose girth is at least :(n-c)+ 1 where n and c are the numbers of vertices and connecte