On Perfect Absorbants in De Bruijn Digraphs

DOI10.1007/978-3-642-38756-2_31zbMath1303.05076OpenAlexW22103331MaRDI QIDQ5405942

Ton Kloks, Yue-Li Wang, Kuo-Hua Wu

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38756-2_31

zbMATH Keywords

upper bounddominationgeneralized de Bruijn digraphsabsorbant

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Efficient closed domination in digraph products ⋮ Efficient twin domination in generalized de Bruijn digraphs ⋮ Efficient absorbants in generalized de Bruijn digraphs

This page was built for publication: On Perfect Absorbants in De Bruijn Digraphs