On persistent directed graphs

Jørgen Bang-Jensen, Tibor Jordán

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

The concept of persistent directed graphs was introduced by Hendrickx et al. to help analyze the stability of autonomous agent systems. They provided a combinatorial characterization for persistence but the complexity of testing persistence remained open. In this note we show that for directed graphs D with ΣvεV(D) min{δD(V),2} ≤ 2| V (D)

Original languageEnglish
Pages (from-to)271-276
Number of pages6
JournalNetworks
Volume52
Issue number4
DOIs
Publication statusPublished - Dec 1 2008

    Fingerprint

Keywords

  • Acyclic digraphs
  • Autonomous agent formations
  • Minimally rigid graphs
  • Orientations
  • Persistent digraphs

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this