✦ LIBER ✦

Graphs with prescribed local connectivities

✍ Scribed by Donald W. Vanderjagt

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 537 KB
Volume: 10
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(74)90129-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Connected graphs with prescribed median

Connected graphs with prescribed median and periphery

✍ Steven J. Winters 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 605 KB

The eccentricity e(v) of a vertex v in a connected graph G is the distance between v and a vertex furthest from v in G. The center C(G) of G is the subgraph induced by those vertices of G having minimum eccentricity; the periphery P(G) is the subgraph induced by those vertices of G having maximum ec

Cycles in Graphs with Prescribed Stabili

Cycles in Graphs with Prescribed Stability Number and Connectivity

✍ M. Kouider 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 113 KB

Constructing a bipartite graph of maximu

Constructing a bipartite graph of maximum connectivity with prescribed degrees

✍ Asano, Takao 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB 👁 3 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and

On local connectivity of graphs

✍ Lutz Volkmann 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 151 KB

The local connectivity κ(u, v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as } for all pairs u and v of vertices in G. Let δ(G) be the minimum degree of G. We call a graph G maximally connected when κ(G) = δ

On the existence of N-connected graphs w

On the existence of N-connected graphs with prescribed degrees (n ≧ 2)

✍ D. L. Wang; D. J. Kleitman 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 648 KB