Premium
Conditional connectivity
Author(s) -
Harary Frank
Publication year - 1983
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230130303
Subject(s) - combinatorics , graph , mathematics , property (philosophy) , connected component , cardinality (data modeling) , connectivity , discrete mathematics , line graph , computer science , analogy , theoretical computer science , data mining , philosophy , epistemology , linguistics
For a noncomplete graph G , the traditional definition of its connectivity is the minimum number of points whose removal results in a disconnected subgraph with components H 1 ,…, H k . The conditional connectivity of G with respect to some graph‐theoretic property P is the smallest cardinality of a set S of points, if any, such that every component H i of the disconnected graph G ‐ S has property P. A survey of promising properties P is presented. Questions for various P ‐connectivities are listed in analogy with known results on connectivity and line‐connectivity.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom