✦ LIBER ✦

Paramodulated connection graphs

✍ Scribed by Jörg Siekmann; Graham Wrightson

Book ID: 104705961
Publisher: Springer-Verlag
Year: 1980
Tongue: English
Weight: 956 KB
Volume: 13
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00288537

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proper connection of graphs

✍ Valentin Borozan; Shinya Fujita; Aydin Gerek; Colton Magnant; Yannis Manoussakis 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 271 KB

Graphs with prescribed connectivity and

Graphs with prescribed connectivity and line graph connectivity

✍ Douglas Bauer; Ralph Tindell 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

## Abstract Chartrand and Stewart have shown that the line graph of an __n__‐connected graph is itself __n__‐connected. This paper shows that for every pair of integers __m__ > __n__ > 1 there is a graph of point connectivity __n__ whose line graph has point connectivity __m__. The corresponding qu

The Connectivities of Leaf Graphs of 2-C

The Connectivities of Leaf Graphs of 2-Connected Graphs

✍ Atsushi Kaneko; Kiyoshi Yoshimoto 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Given a connected graph G, denote by V the family of all the spanning trees of G. Define an adjacency relation in V as follows: the spanning trees t and t$ are said to be adjacent if for some vertex u # V, t&u is connected and coincides with t$&u. The resultant graph G is called the leaf graph of G.

Rainbow vertex -connection in graphs

✍ Liu, Henry; Mestre, Ângela; Sousa, Teresa 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 683 KB

Path connected graphs

✍ R. J. Faudree; R. H. Schelp 📂 Article 📅 1974 🏛 Akadmiai Kiad 🌐 English ⚖ 467 KB

GRAPH CONNECTIVITY ALGORITHM

✍ Joseph B. Frechen 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 452 KB