✦ LIBER ✦

The number of cut vertices and cut arcs in a strong directed graph

✍ Scribed by S. B. Rao; A. Ramachandra Rao

Publisher: Akadmiai Kiad
Year: 1972
Tongue: English
Weight: 704 KB
Volume: 22
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01896438

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

The least eigenvalue of a graph with cut

The least eigenvalue of a graph with cut vertices

✍ Yi Wang; Yi-Zheng Fan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 175 KB

A Faster Algorithm for Finding the Minim

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph

✍ J.X. Hao; J.B. Orlin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum

On the number of small cuts in a graph

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

The inverse inertia problem for graphs:

The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample

✍ Wayne Barrett; H. Tracy Hall; Raphael Loewy 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 528 KB

Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G asks which inertias can be attained by a matrix in S(G). We giv

Packings of cuts realizing distances bet

Packings of cuts realizing distances between certain vertices in a planar graph

✍ A.V. Karzanov 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 958 KB

Recently A. Schrijver proved the following theorem. Suppose that G = (V, E) is a connected planar graph embedded in the euclidean plane, that 0 and Z are two of its faces, and that the edges e E E have nonnegative integer-valued lengths Z(e) such that the length of each circuit in G is even. Then th