Home Cut-primitive directed graphs versus clan-primitive directed graphs
Article
Licensed
Unlicensed Requires Authentication

Cut-primitive directed graphs versus clan-primitive directed graphs

  • Youssef Boudabbous and Pierre Ille
Published/Copyright: April 12, 2010
Become an author with De Gruyter Brill
Advances in Pure and Applied Mathematics
From the journal Volume 1 Issue 2

Abstract

Given a directed graph G = (V,A), a subset X of V is a clan of G provided that for a, bX and xV \ X, (a, x) ∈ A if and only if (b, x) ∈ A, and similarly for (x, a) and (x, b). For instance, ∅, V and {x}, where xV, are clans of G, called trivial. A directed graph is clan-primitive if all its clans are trivial. Given a directed graph G = (V,A), a subset X of V is a cut of G if X and V \ X are clans of G. For example, ∅ and V are cuts of G, called trivial. A directed graph is cut-primitive if all its cuts are trivial. Ehrenfeucht and Rozenberg [Theoret. Comput. Sci. 70: 343–358, 1990] proved: Given a clan-primitive directed graph G = (V,A), if X is a subset of V such that |X| ≥ 3, |V \ X| ≥ 2 and G[X] is clan-primitive, then there are xyV \ X such that G[X ∪ {x, y}] is clan-primitive. We show: Given a clan-primitive directed graph G = (V,A), if X is a proper subset of V such that |X| ≥ 3 and G[X] is cut-primitive, then there are x, yV \ X such that G[X ∪ {x, y}] is cut-primitive and {x}, {y} are maximal proper clans of G[X ∪ {x, y}].

Received: 2008-08-25
Revised: 2009-05-07
Published Online: 2010-04-12
Published in Print: 2010-June

© de Gruyter 2010

Downloaded on 4.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/apam.2010.013/html
Scroll to top button