Conditionally critical indecomposable graphs

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 - {aj1, bj1, . . . , ajs, bjs} are also X-critical for any collection of pairs {(a j1, bj1), . . . ,(ajs, bjs)}. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Dubey, C. K., Mehta, S. K., & Deogun, J. S. (2005). Conditionally critical indecomposable graphs. In Lecture Notes in Computer Science (Vol. 3595, pp. 690–700). Springer Verlag. https://doi.org/10.1007/11533719_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free