✦ LIBER ✦

The majorization theorem of connected graphs

✍ Scribed by Muhuo Liu; Bolian Liu; Zhifu You

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 123 KB
Volume: 431
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.03.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results on the majorization theorem

Some results on the majorization theorem of connected graphs

✍ Mu Huo Liu; Bo Lian Liu 📂 Article 📅 2012 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 207 KB

Turán's theorem and k-connected graphs

✍ Nicolas Bougard; Gwenaël Joret 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

## Abstract The minimum size of a __k__‐connected graph with given order and stability number is investigated. If no connectivity is required, the answer is given by Turán's Theorem. For connected graphs, the problem has been solved recently independently by Christophe et al., and by Gitler and Val

A local structure theorem on 5-connected

A local structure theorem on 5-connected graphs

✍ Kiyoshi Ando 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

## Abstract An edge of a 5‐connected graph is said to be contractible if the contraction of the edge results in a 5‐connected graph. Let __x__ be a vertex of a 5‐connected graph. We prove that if there are no contractible edges whose distance from __x__ is two or less, then either there are two tri

Note on Halin's theorem on minimally con

Note on Halin's theorem on minimally connected graphs

✍ T Kameda 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 205 KB

An 11-vertex theorem for 3-connected cub

An 11-vertex theorem for 3-connected cubic graphs

✍ R. E. L. Aldred; BauSheng; D. A. Holton; Gordon F. Royle 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 451 KB 👁 1 views

In this paper w e determine the circumstances under which a set of 11 vertices in a 3-connected cubic graph lies on a cycle. In addition, w e consider the number of such cycles that exist and characterize those graphs in which a set of 9 vertices lies in exactly two cycles.

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.