✦ LIBER ✦

Traversability and connectivity of the middle graph of a graph

✍ Scribed by Takashi Hamada; Izumi Yoshimura

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 871 KB
Volume: 14
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90037-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The rainbow connectivity of a graph

✍ Gary Chartrand; Garry L. Johns; Kathleen A. McKeon; Ping Zhang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

Local connectivity of a random graph

✍ P. Erdös; E. M. Palmer; R. W. Robinson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract A graph is locally connected if for each vertex ν of degree __≧2__, the subgraph induced by the vertices adjacent to ν is connected. In this paper we establish a sharp threshold function for local connectivity. Specifically, if the probability of an edge of a labeled graph of order __n_

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.

On the edge-connectivity vector of a gra

On the edge-connectivity vector of a graph

✍ Linda M. Lesniak; Raymond E. Pippert 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

The decompositions of line graphs, middl

The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests

✍ Jin Akiyama; Takashi Hamada 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 461 KB

We construct decompositions of L(K,,), M(K,,) and T(K,,) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs. ## 1. Preliminaries In this paper a graph is cons

The connectivity of the basis graph of a

The connectivity of the basis graph of a branching greedoid

✍ H. J. Broersma; Li Xueliang 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB 👁 1 views

## Abstract A result of Korte and Lovász states that the basis graph of every 2‐ connected greedoid is connected. We prove that the basis graph of every 3‐connected branching greedoid is (δ ‐‐ 1)‐connected, where δ is the minimum in‐degree (disregarding the root) of the underlying rooted directed (