𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian Decomposition of Lexicographic Products of Digraphs

✍ Scribed by Lenhard L. Ng

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
490 KB
Volume
73
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Orientations of hamiltonian cycles in la
Orientations of hamiltonian cycles in large digraphs
✍ Adam Paweł Wojda 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

We prove that, with some exceptions, every digraph with n 3 9 vertices and at least ( n -1) ( n -2) + 2 arcs contains all orientations of a Hamiltonian cycle.

On non-Hamiltonian circulant digraphs of
On non-Hamiltonian circulant digraphs of outdegree three
✍ Locke, Stephen C.; Witte, Dave 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

We construct infinitely many connected, circulant digraphs of outdegree three that have no Hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is adjacent to two diametrically opposite vertices, or every vert

Unretractive and S-unretractive joins an
Unretractive and S-unretractive joins and lexicographic products of graphs
✍ Ulrich Knauer 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 515 KB

Graphs without proper endomorphisms are the subject of this article. It is shown that the join of two graphs has this property if and only if both summands have it, and that the lexicographic product of a complete graph or an odd circuit as first factors has this property if and only if the second f

Hamiltonian threshold for strong product
Hamiltonian threshold for strong products of graphs
✍ Daniel Král'; Ladislav Stacho 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We prove that the strong product of any at least ${({\rm ln}}\, {2})\Delta+{O}(\sqrt{\Delta})$ non‐trivial connected graphs of maximum degree at most Δ is pancyclic. The obtained result is asymptotically best possible since the strong product of ⌊(ln 2)__D__⌋ stars __K__~1,__D__~ is not

Thermal decomposition products of cellul
Thermal decomposition products of cellulose
✍ Yoshio Tsuchiya; Kikuo Sumi 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 447 KB 👁 1 views

## Abstract Untreated and flame‐retardant‐treated cellulose were thermally decomposed under vacuum and the products were quantitatively analyzed by gas chromatography. An unidentified product at a retention index of 2270 (between 5‐methylfurfural and 5‐hydroxymethylfurfural), α‐ and β‐D‐glucose, an