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

Codes related to line graphs of triangular graphs and permutation decoding

โœ Scribed by Fish, Washiela; Kumwenda, Khumbo; Mwambene, Eric


Book ID
118137057
Publisher
Taylor and Francis Group
Year
2012
Tongue
English
Weight
279 KB
Volume
35
Category
Article
ISSN
1607-3606

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


3-Connected line graphs of triangular gr
โœ H. J. Broersma; H. J. Veldman ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 368 KB ๐Ÿ‘ 1 views

A graph is k-triangular if each edge is in at least k triangles. Triangular is a synonym for l-triangular. It is shown that the line graph of a triangular graph of order at least 4 is panconnected if and only if it is 3-connected. Furthermore, the line graph of a k-triangular graph is k-harniltonian