Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ismael González Yero / rank
Normal rank
 
Property / author
 
Property / author: Ismael González Yero / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964079446 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1511.01916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vizing's conjecture: a survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd neighborhood transversals on grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-correcting codes on the Towers of Hanoi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect domination in regular grid 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 power domination: propagation radius and Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of trees and graphs with equal domination parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on variants of covering codes in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of subdivided-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm to determine all shortest paths in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in direct graph bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight-optimal circulants vis-à-vis twisted tori / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs S(n, k) and a Variant of the Tower of Hanoi Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-perfect codes in Sierpiński graphs / 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: Q2718351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480690 / 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: Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes over graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open k-monopolies in graphs: complexity and related concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global strong defensive alliances of Sierpiński-like 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: Q4390693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient open domination in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3011805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in direct products of cycles-a complete characterization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:56, 13 July 2024

scientific article
Language Label Description Also known as
English
Graphs that are simultaneously efficient open domination and efficient closed domination graphs
scientific article

    Statements

    Graphs that are simultaneously efficient open domination and efficient closed domination graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    efficient open domination
    0 references
    efficient closed domination
    0 references
    perfect code
    0 references
    computational complexity
    0 references
    Sierpiński graph
    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