𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The connectivity and minimum degree of circuit graphs of matroids

✍ Scribed by Ping Li; Gui Zhen Liu

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2010
Tongue
English
Weight
230 KB
Volume
26
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Realizability of p-point graphs with pre
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity
✍ F. T. Boesch; C. L. Suffel πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 316 KB

## Abstract It is well known that certain graph‐theoretic extremal questions play a central role in the study of communication network vulnerability. Herein we consider a generalization of some of the classical results in this area. We define a (__p__, Ξ”, Ξ΄, Ξ») graph as a graph having __p__ points,

Graph decomposition with constraints on
Graph decomposition with constraints on the connectivity and minimum degree
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 145 KB πŸ‘ 1 views

## Abstract For each pair __s,t__ of natural numbers there exist natural numbers __f(s,t)__ and __g(s,t)__ such that the vertex set of each graph of connectivity at least __f(s,t)__ (respectively minimum degree at least __g(s,t))__ has a decomposition into sets which induce subgraphs of connectivit

Sufficient conditions for equality of co
Sufficient conditions for equality of connectivity and minimum degree of a graph
✍ Jerzy Topp; Lutz Volkmann πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 270 KB πŸ‘ 1 views

## Abstract For a graph __G__, let __n__(__G__), ΞΊ(__G__) and Ξ΄(__G__) denote the order, the connectivity, and the minimum degree of __G__, respectively. The paper contains some conditions on __G__ implying ΞΊ(__G__) = Ξ΄(__G__). One of the conditions is that __n__(__G__) ≀ Ξ΄(__G__)(2__p__ βˆ’1)/(2__p_