✦ LIBER ✦

Graphs with the smallest number of minimum cut sets

✍ Scribed by Derek Smith

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 630 KB
Volume: 14
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230140105

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of cut-vertices in a graph of

The number of cut-vertices in a graph of given minimum degree

✍ Michael O. Albertson; David M. Berman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in

Graphs with unique minimum edge dominati

Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices

✍ Jerzy Topp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s

The number of cutvertices in graphs with

The number of cutvertices in graphs with given minimum degree

✍ L.H. Clark; R.C. Entringer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 453 KB

The maximum number of cutvertices in a connected graph of order n having minimum degree at least 6 is determined for 6 > 5.

Graphs with given odd sets and the least

Graphs with given odd sets and the least number of vertices

✍ Louis Hakimi, S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 2 views

This note presents a solution to the following problem posed by Chen, Schelp, and Soltés: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.

On the number of small cuts in a graph

✍ Monika Henzinger; David P. Williamson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 356 KB

The number of maximal independent sets i

The number of maximal independent sets in connected graphs

✍ Zoltán Füredi 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,