𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exponential Families of Non-Isomorphic Triangulations of Complete Graphs

✍ Scribed by C.Paul Bonnington; M.J. Grannell; T.S. Griggs; J. Širáň

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
235 KB
Volume
78
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that the number of non-isomorphic face 2-colourable triangulations of the complete graph K n in an orientable surface is at least 2 n 2 Â54&O(n) for n congruent to 7 or 19 modulo 36, and is at least 2 2n 2 Â81&O(n) for n congruent to 19 or 55 modulo 108.

📜 SIMILAR VOLUMES

An isomorphic factorization of the compl
An isomorphic factorization of the complete graph
✍ F. K. Hwang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

We give necessary and sufficient conditions that the complete graph K, has an isomorphic factorization into Kr X K,. We show that this factorization has an application to clone library screening.

Isomorphic factorization of the complete
Isomorphic factorization of the complete graph into Cayley digraphs
✍ G. L. Chia; Poh-Hwa Ong 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract Let __Z__~__p__~ denote the cyclic group of order __p__ where __p__ is a prime number. Let __X__ = __X__(__Z__~__p__~, __H__) denote the Cayley digraph of __Z__~__p__~ with respect to the symbol __H__. We obtain a necessary and sufficient condition on __H__ so that the complete graph on

Remarks on the placeability of isomorphi
Remarks on the placeability of isomorphic trees in a complete graph
✍ Hasunuma, Toru; Shibata, Yukio 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB 👁 3 views

Let Tp be any tree of order p and A ( T p ) stand for the maximum degree of the vertices of Tp. We prove the following theorem. "If A(Tp) 5 pi, where p > 2i, then Tp is i-placeable in Kp" is true if and only if i = 1, 2, and 3. 0 1996 John Wiley & Sons, Inc. Suppose G is a graph and V ( G ) , E ( G