Perfect domination sets in Cayley graphs (Q741744): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5545841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient open domination in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all graph coverings by permutation voltage assignments / 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: Q4954629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum genus of graph bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing covering codes with given automorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in <i>n</i>‐cubes / rank
 
Normal rank

Latest revision as of 00:47, 9 July 2024

scientific article
Language Label Description Also known as
English
Perfect domination sets in Cayley graphs
scientific article

    Statements

    Perfect domination sets in Cayley graphs (English)
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    Cayley graph
    0 references
    perfect domination set
    0 references
    graph bundle
    0 references

    Identifiers