On efficient absorbant conjecture in generalized De Bruijn digraphs (Q4976295): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q123191917 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207160.2016.1154949 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2331464735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on efficient domination in a superclass of \(P_5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups as efficient dominating sets in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case efficient dominating sets in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dominating sets in Cayley graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dominating sets in circulant graphs with domination number prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized de Bruijn digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Routing in DeBruijn Comrnunication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Sums Of De Bruijn Interconnection Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bondage numbers and efficient dominations of vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design to Minimize Diameter on Building-Block Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Design for Directed Graphs with Minimum Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Regular Directed Graphs with Small Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost complete description of perfect codes in direct products of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient domination in cubic vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes over graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient domination in circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent perfect domination sets in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfect codes in Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On<i>m</i>-restricted edge connectivity of undirected generalized De Bruijn graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absorbant of generalized de Bruijn digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient twin domination in generalized de Bruijn digraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:17, 14 July 2024

scientific article; zbMATH DE number 6754507
Language Label Description Also known as
English
On efficient absorbant conjecture in generalized De Bruijn digraphs
scientific article; zbMATH DE number 6754507

    Statements

    On efficient absorbant conjecture in generalized De Bruijn digraphs (English)
    0 references
    0 references
    0 references
    0 references
    28 July 2017
    0 references
    absorbant
    0 references
    efficient absorbant
    0 references
    dominating set
    0 references
    efficient dominating set
    0 references
    generalized de Bruijn digraph
    0 references

    Identifiers