✦ LIBER ✦

On k-graceful, locally finite graphs

✍ Scribed by Peter J Slater

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 207 KB
Volume: 35
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(83)90058-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On k-graceful, countably infinite graphs

✍ Peter J Slater 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 718 KB

On skolem graceful graphs

✍ S.M. Lee; S.C. Shee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Lee, S.M. and SC. Shee, On Skolem graceful graphs, Discrete Mathematics 93 (1991) 195-200. A Skolem graceful labelling of graphs is introduced. It is shown that a tree is Skolem graceful iff it is graceful. The Skolem deficiency of a graph is defined and Skolem deficiencies of some well-known graphs

Quantifier-eliminable locally finite gra

Quantifier-eliminable locally finite graphs

✍ Shawn Hedman; Wai Yan Pong 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB

We identify the locally finite graphs that are quantifier-eliminable and their first order theories in the signature of distance predicates.

Finite Separating Sets in Locally Finite

Finite Separating Sets in Locally Finite Graphs

✍ H.A. Jung; M.E. Watkins 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 386 KB

An \((m, n)\)-separator of an infinite graph \(\Gamma\) is a smallest finite set of vertices whose deletion leaves at least \(m\) finite components and at least \(n\) infinite components. It is shown that a vertex of \(\Gamma\) of finite valence belongs to only finitely many \((0,2)\)-separators. Va

On locally k-critically n-connected grap

On locally k-critically n-connected graphs

✍ Jianji Su 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 479 KB

Su, J., On locally k-critically n-connected graphs, Discrete Mathematics 120 (1993) 183-190. Let 0 # W'g V(G). The graph G is called a W-locally k-critically n-connected graph or simply a W-locally (n, k)-graph, if for all V'G W with 1 V'I 6 k and each fragment F of G we have that K(G-V')=n-1 V' and

On bounded automorphisms of locally fini

On bounded automorphisms of locally finite transitive graphs

✍ Niemeyer, Peter 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 517 KB

The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This co