𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Landscape connectivity: A conservation application of graph theory

✍ Scribed by A.G Bunn; D.L Urban; T.H Keitt


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
427 KB
Volume
59
Category
Article
ISSN
0301-4797

No coin nor oath required. For personal study only.

✦ Synopsis


We use focal-species analysis to apply a graph-theoretic approach to landscape connectivity in the Coastal Plain of North Carolina. In doing so we demonstrate the utility of a mathematical graph as an ecological construct with respect to habitat connectivity. Graph theory is a well established mainstay of information technology and is concerned with highly efficient network flow. It employs fast algorithms and compact data structures that are easily adapted to landscape-level focal species analysis. American mink (Mustela vison) and prothonotary warblers (Protonotaria citrea) share the same habitat but have different dispersal capabilities, and therefore provide interesting comparisons on connections in the landscape. We built graphs using GIS coverages to define habitat patches and determined the functional distance between the patches with least-cost path modeling. Using graph operations concerned with edge and node removal we found that the landscape is fundamentally connected for mink and fundamentally unconnected for prothonotary warblers. The advantage of a graph-theoretic approach over other modeling techniques is that it is a heuristic framework which can be applied with very little data and improved from the initial results. We demonstrate the use of graph theory in a metapopulation context, and suggest that graph theory as applied to conservation biology can provide leverage on applications concerned with landscape connectivity.


πŸ“œ SIMILAR VOLUMES


Local connectivity of a random graph
✍ P. ErdΓΆs; E. M. Palmer; R. W. Robinson πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 255 KB

## Abstract A graph is locally connected if for each vertex Ξ½ of degree __≧2__, the subgraph induced by the vertices adjacent to Ξ½ is connected. In this paper we establish a sharp threshold function for local connectivity. Specifically, if the probability of an edge of a labeled graph of order __n_

The rainbow connectivity of a graph
✍ Gary Chartrand; Garry L. Johns; Kathleen A. McKeon; Ping Zhang πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 140 KB
Application of Graph Theory: Relationshi
✍ S. Gupta; M. Singh; A.K. Madan πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 90 KB

Graph theory was successfully applied in developing a relationship between chemical structure and biological activity. The relationship of two graph invariants ᎏthe eccentric connecti¨ity index and the Wiener's index was investigated with regard to anti-inflammatory activity, for a data set consisti

On k-leaf connectivity of a random graph
✍ Thomasz Luczak πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 367 KB

We prove that, in a random graph with n vertices and N = cn log n edges, the subgraph generated by a set of all vertices of degree at least k + 1 is k-leaf connected for c > f . A threshold function for k-leaf connectivity is also found. ## 1. MAIN RESULTS Let G = (V(G),E(G)) be a graph, where V (

On the edge-connectivity vector of a gra
✍ Linda M. Lesniak; Raymond E. Pippert πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 202 KB