scientific article; zbMATH DE number 1124608
From MaRDI portal
Publication:4378637
zbMath0887.05029MaRDI QIDQ4378637
D. Pillone, Jayati Ghoshal, Renu C. Laskar
Publication date: 28 April 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20)
Related Items (22)
A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) ⋮ Absorbant of generalized de Bruijn digraphs ⋮ On the domination polynomial of a digraph: a generation function approach ⋮ Decision-support with preference constraints ⋮ Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 ⋮ Unions of digraphs which become kernel perfect ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ Partitioning vertices into in- and out-dominating sets in digraphs ⋮ Directed domination in oriented graphs ⋮ A greedy partition lemma for directed domination ⋮ Twin domination in generalized Kautz digraphs ⋮ The domination number of wrapped butterfly digraphs ⋮ ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS ⋮ Domination in a digraph and in its reverse ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ Dominating sets in directed graphs ⋮ Making choices with a binary relation: relative choice axioms and transitive closures ⋮ On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs ⋮ Domination in Digraphs ⋮ On the out-domination and in-domination numbers of a digraph ⋮ On the \(k\)-domination number of digraphs ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs
This page was built for publication:
