2-power domination number for Knödel graphs and its application in communication networks (Q6181254): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the double domination number in maximal outerplanar and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5197581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in cylinders, tori, and generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5374237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \({k}\)-power domination of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized power domination of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-power domination problem in weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized power domination: propagation radius and Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Power Domination in Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on power domination in grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Knödel graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bound on the Diameter of the Knödel Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Graphs Applied to Electric Power Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete rotations in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New gossips and telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination of the Cartesian product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in 4-regular Knödel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in cubic Knodel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained double Roman domination of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal PMU placement problem in octahedral networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in Knödel graphs and Hanoi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-power domination in block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in graphs / rank
 
Normal rank

Latest revision as of 19:18, 23 August 2024

scientific article; zbMATH DE number 7792481
Language Label Description Also known as
English
2-power domination number for Knödel graphs and its application in communication networks
scientific article; zbMATH DE number 7792481

    Statements

    2-power domination number for Knödel graphs and its application in communication networks (English)
    0 references
    22 January 2024
    0 references
    domination
    0 references
    power domination
    0 references
    2-power domination
    0 references
    Knödel graph
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references