New and improved results on the signed (total) k-domination number of graphs (Q5347258): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The signed \(k\)-domination number of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited packings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Signed (Total) $k$-Domination Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5392261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2846636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed Total Domination Nnumber of a Graph / rank
 
Normal rank

Revision as of 20:26, 13 July 2024

scientific article; zbMATH DE number 6722500
Language Label Description Also known as
English
New and improved results on the signed (total) k-domination number of graphs
scientific article; zbMATH DE number 6722500

    Statements

    New and improved results on the signed (total) k-domination number of graphs (English)
    0 references
    0 references
    0 references
    23 May 2017
    0 references
    bipartite graph
    0 references
    limited packing
    0 references
    open packing
    0 references
    signed \(k\)-domination
    0 references
    signed total \(k\)-domination
    0 references

    Identifiers