✦ LIBER ✦

Cycles in Graphs with Prescribed Stability Number and Connectivity

✍ Scribed by M. Kouider

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 113 KB
Volume: 60
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1023

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

Regular graphs with prescribed chromatic

Regular graphs with prescribed chromatic number

✍ L. Caccetta; N. J. Pullman 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract We determine the minimum number of edges in a regular connected graph on __n__ vertices, containing a complete subgraph of order __k__ ≤ __n__/2. This enables us to confirm and strengthen a conjecture of P. Erdös on the existence of regular graphs with prescribed chromatic number.

On connectivity in graphs with given cli

On connectivity in graphs with given clique number

✍ Angelika Hellwig; Lutz Volkmann 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 1 views

## Abstract We consider finite, undirected, and simple graphs __G__ of order __n__(__G__) and minimum degree δ(__G__). The connectivity κ(__G__) for a connected graph __G__ is defined as the minimum cardinality over all vertex‐cuts. If κ(__G__) < δ(__G__), then Topp and Volkmann 7 showed in 1993 f

On the Number of Cycles in 3-Connected C

On the Number of Cycles in 3-Connected Cubic Graphs

✍ R.E.L Aldred; Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Let f (n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f (n) is subexponential and conjectured that f (n) is superpolynomial. We verify this by showing that, for n sufficie

Total domination in 2-connected graphs a

Total domination in 2-connected graphs and in graphs with no induced 6-cycles

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB 👁 1 views

## Abstract A set __S__ of vertices in a graph __G__ is a total dominating set of __G__ if every vertex of __G__ is adjacent to some vertex in __S__. The minimum cardinality of a total dominating set of __G__ is the total domination number γ~t~(__G__) of __G__. It is known [J Graph Theory 35 (2000)

On local connectivity of graphs with giv

On local connectivity of graphs with given clique number

✍ Andreas Holtkamp; Lutz Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. 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