Conditionally critical indecomposable graphs

Chandan K. Dubey, Shashank K. Mehta, Jitender S Deogun

Research output: Contribution to journalConference article

3 Citations (Scopus)

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)}.

Original languageEnglish (US)
Pages (from-to)690-700
Number of pages11
JournalLecture Notes in Computer Science
Volume3595
StatePublished - Oct 24 2005
Event11th Annual International Conference on Computing and Combinatorics, COCOON 2005 - Kunming, China
Duration: Aug 16 2005Aug 29 2005

Fingerprint

Induced Subgraph
Graph in graph theory
Subset
Decomposable
Undirected Graph
Cardinality
Module

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Conditionally critical indecomposable graphs. / Dubey, Chandan K.; Mehta, Shashank K.; Deogun, Jitender S.

In: Lecture Notes in Computer Science, Vol. 3595, 24.10.2005, p. 690-700.

Research output: Contribution to journalConference article

Dubey, Chandan K. ; Mehta, Shashank K. ; Deogun, Jitender S. / Conditionally critical indecomposable graphs. In: Lecture Notes in Computer Science. 2005 ; Vol. 3595. pp. 690-700.
@article{5209b30e405640febf3d580131426c6f,
title = "Conditionally critical indecomposable graphs",
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)}.",
author = "Dubey, {Chandan K.} and Mehta, {Shashank K.} and Deogun, {Jitender S}",
year = "2005",
month = "10",
day = "24",
language = "English (US)",
volume = "3595",
pages = "690--700",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Conditionally critical indecomposable graphs

AU - Dubey, Chandan K.

AU - Mehta, Shashank K.

AU - Deogun, Jitender S

PY - 2005/10/24

Y1 - 2005/10/24

N2 - 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)}.

AB - 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)}.

UR - http://www.scopus.com/inward/record.url?scp=26844435326&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844435326&partnerID=8YFLogxK

M3 - Conference article

VL - 3595

SP - 690

EP - 700

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -