
doi: 10.1007/11533719_70
Let X be a subset of vertices of an undirected graph G=(V,E). G is X-critical if it is indecomposable and its induced subgraph on X vertices is also indecomposable, but all induced subgraphs on V–{w} are decomposable for all w ∈ V–X. We present two results in this paper. The first result states that if G is X-critical, then for every w ∈ V–{x}, G[V–{w}] has a unique non-trivial module and its cardinality is either 2 or |V|–2. The second result is that the vertices of V–X can be paired up as (a1,b1), ..., (ak,bk) such that induced subgraphs on subset $V-\{a_{j_1},b_{j_1}, \ldots, a_{j_s},b_{j_s}\}$ are also X-critical for any collection of pairs $\{(a_{j_1},b_{j_1}), \ldots, (a_{j_s},b_{j_s})\}$.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
