- Title
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Creator
- Balbuena, Camino; Lin, Yuqing; Miller, Mirka
- Date
- 2007
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/43769
- Identifier
- vital:95
- Identifier
-
https://doi.org/10.1016/j.dam.2007.11.015
- Identifier
- ISSN:0166-218X
- Abstract
- A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X must have at least two vertices. The restricted connectivity; C1
- Publisher
- Elsevier
- Relation
- Discrete Applied Mathematics Vol. , no. (2007), p.
- Rights
- Copyright Elsevier
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Diameter; Girth; Restricted connectivity
- Reviewed
- Hits: 973
- Visitors: 969
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|