Decomposition tree and indecomposable coverings

Andrew Breiner, Jitender Deogun, Pierre Ille

Research output: Contribution to journalArticle

Abstract

Let G = (V,A) be a directed graph. With any subset X of V is associated the directed subgraph G[X] = (X,A ∩ (X × X)) of G induced by X. A subset X of V is an interval of G provided that for a, b ∈ X and x ∈ V \ X, (a, x) ∈ A if and only if (b, x) ∈ A, and similarly for (x, a) and (x, b). For example ∅, V, and {x}, where x ∈ V , are intervals of G which are the trivial intervals. A directed graph is indecomposable if all its intervals are trivial. Given an integer k > 0, a directed graph G = (V,A) is called an indecomposable k- covering provided that for every subset X of V with |X| ≤ k, there exists a subset Y of V such that X ⊆ Y , G[Y] is indecomposable with |Y| ≥ 3. In this paper, the indecomposable k-covering directed graphs are characterized for any k > 0.

Original languageEnglish (US)
Pages (from-to)37-44
Number of pages8
JournalDiscussiones Mathematicae - Graph Theory
Volume31
Issue number1
DOIs
StatePublished - 2011

Fingerprint

Tree Decomposition
Directed graphs
Directed Graph
Covering
Decomposition
Interval
Subset
Trivial
Covering Graph
Subgraph
If and only if
Integer

Keywords

  • decomposition tree
  • indecomposable
  • interval
  • k-covering

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

Decomposition tree and indecomposable coverings. / Breiner, Andrew; Deogun, Jitender; Ille, Pierre.

In: Discussiones Mathematicae - Graph Theory, Vol. 31, No. 1, 2011, p. 37-44.

Research output: Contribution to journalArticle

Breiner, Andrew ; Deogun, Jitender ; Ille, Pierre. / Decomposition tree and indecomposable coverings. In: Discussiones Mathematicae - Graph Theory. 2011 ; Vol. 31, No. 1. pp. 37-44.
@article{4d8bd1b2e3b14edeaff6906c3dd46ce6,
title = "Decomposition tree and indecomposable coverings",
abstract = "Let G = (V,A) be a directed graph. With any subset X of V is associated the directed subgraph G[X] = (X,A ∩ (X × X)) of G induced by X. A subset X of V is an interval of G provided that for a, b ∈ X and x ∈ V \ X, (a, x) ∈ A if and only if (b, x) ∈ A, and similarly for (x, a) and (x, b). For example ∅, V, and {x}, where x ∈ V , are intervals of G which are the trivial intervals. A directed graph is indecomposable if all its intervals are trivial. Given an integer k > 0, a directed graph G = (V,A) is called an indecomposable k- covering provided that for every subset X of V with |X| ≤ k, there exists a subset Y of V such that X ⊆ Y , G[Y] is indecomposable with |Y| ≥ 3. In this paper, the indecomposable k-covering directed graphs are characterized for any k > 0.",
keywords = "decomposition tree, indecomposable, interval, k-covering",
author = "Andrew Breiner and Jitender Deogun and Pierre Ille",
year = "2011",
doi = "10.7151/dmgt.1528",
language = "English (US)",
volume = "31",
pages = "37--44",
journal = "Discussiones Mathematicae - Graph Theory",
issn = "1234-3099",
publisher = "University of Zielona Gora",
number = "1",

}

TY - JOUR

T1 - Decomposition tree and indecomposable coverings

AU - Breiner, Andrew

AU - Deogun, Jitender

AU - Ille, Pierre

PY - 2011

Y1 - 2011

N2 - Let G = (V,A) be a directed graph. With any subset X of V is associated the directed subgraph G[X] = (X,A ∩ (X × X)) of G induced by X. A subset X of V is an interval of G provided that for a, b ∈ X and x ∈ V \ X, (a, x) ∈ A if and only if (b, x) ∈ A, and similarly for (x, a) and (x, b). For example ∅, V, and {x}, where x ∈ V , are intervals of G which are the trivial intervals. A directed graph is indecomposable if all its intervals are trivial. Given an integer k > 0, a directed graph G = (V,A) is called an indecomposable k- covering provided that for every subset X of V with |X| ≤ k, there exists a subset Y of V such that X ⊆ Y , G[Y] is indecomposable with |Y| ≥ 3. In this paper, the indecomposable k-covering directed graphs are characterized for any k > 0.

AB - Let G = (V,A) be a directed graph. With any subset X of V is associated the directed subgraph G[X] = (X,A ∩ (X × X)) of G induced by X. A subset X of V is an interval of G provided that for a, b ∈ X and x ∈ V \ X, (a, x) ∈ A if and only if (b, x) ∈ A, and similarly for (x, a) and (x, b). For example ∅, V, and {x}, where x ∈ V , are intervals of G which are the trivial intervals. A directed graph is indecomposable if all its intervals are trivial. Given an integer k > 0, a directed graph G = (V,A) is called an indecomposable k- covering provided that for every subset X of V with |X| ≤ k, there exists a subset Y of V such that X ⊆ Y , G[Y] is indecomposable with |Y| ≥ 3. In this paper, the indecomposable k-covering directed graphs are characterized for any k > 0.

KW - decomposition tree

KW - indecomposable

KW - interval

KW - k-covering

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

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

U2 - 10.7151/dmgt.1528

DO - 10.7151/dmgt.1528

M3 - Article

AN - SCOPUS:78751504992

VL - 31

SP - 37

EP - 44

JO - Discussiones Mathematicae - Graph Theory

JF - Discussiones Mathematicae - Graph Theory

SN - 1234-3099

IS - 1

ER -