A Taxonomy of Perfect Domination (Q5069690): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/09720529.2014.914288 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074243375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfect codes and related concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized domination and efficient domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient domination of the orientations of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4874598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diagonal Hypergraph of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted independent perfect domination on cocomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-domination and \(k\)-independence in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact double domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly perfect sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in graphs: A survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3032297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets with domination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Codes in Antipodal Distance-Transitive Graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open packing, total domination, and the \(P_3\)-Radon number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing \(r\)-perfect codes in direct products of two and three cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294922 / 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: Q5480690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3495221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular codes in regular graphs are difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted efficient domination problem on some perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Categorical Products of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the existence of perfect constant weight codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on graphs which have equal domination and closed neighbourhood packing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weighted efficient total domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient total domination in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted perfect domination problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:09, 28 July 2024

scientific article; zbMATH DE number 7509037
Language Label Description Also known as
English
A Taxonomy of Perfect Domination
scientific article; zbMATH DE number 7509037

    Statements

    A Taxonomy of Perfect Domination (English)
    0 references
    19 April 2022
    0 references
    dominating set
    0 references
    perfect domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers