𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connected graphs which are not mod sum graphs

✍ Scribed by Martin Sutton; Mirka Miller; Joseph Ryan; Slamin

Book ID
104114176
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
321 KB
Volume
195
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we prove that no wheel with the exception of W4 can be a mod sum graph. We also give the unique (up to multiplication by positive integers) mod sum labelling of W4. We also prove that the symmetric complete bipartite graph K,,,, is not a mod sum graph. (~) 1999 Elsevier Science B.V. All rights reserved

πŸ“œ SIMILAR VOLUMES

Which generalized petersen graphs are ca
Which generalized petersen graphs are cayley graphs?
✍ Roman Nedela; Martin Ε koviera πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 572 KB

## Abstract The generalized Petersen graph __GP__ (__n, k__), __n__ ≀ 3, 1 β‰₯ __k__ < __n__/2 is a cubic graph with vertex‐set {u~j~; i Ο΅ Z~n~} βˆͺ {v~j~; i Ο΅ Z~n~}, and edge‐set {u~i~u~i~, u~i~v~i~, v~i~v~i+k, iΟ΅~Z~n~}. In the paper we prove that (i) __GP__(__n, k__) is a Cayley graph if and only if

When are random graphs connected
When are random graphs connected
✍ S. Kalikow; B. Weiss πŸ“‚ Article πŸ“… 1988 πŸ› The Hebrew University Magnes Press 🌐 English βš– 432 KB
All 4-connected Line Graphs of Claw Free
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 109 KB

Thomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see that 4-connected line graphs of claw free graphs are hamiltonian connected.