Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2017.08.024 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Perfect Matchings in Chemistry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of graphical condensation for enumerating matchings and tilings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical condensation of plane graphs: a combinatorial approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical condensation for enumerating perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic identity for the number of perfect matchings of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and asymptotic enumeration of perfect matchings in self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum matching in a sparse random graph in <i>O</i> ( <i>n</i> ) expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in regular and almost regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pfaffian orientations and perfect matchings of scale-free networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matchings in scale-free networks with identical degree distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds via measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient sub-5 approximations for minimum dominating sets in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of dominating set on power law graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of minimal dominating sets on some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Estimating Maximum Matching Size in Graph Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating minimal connected dominating sets in graphs of bounded chordality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing numbers of Sierpiński‐like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees on the Sierpinski gasket / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of spanning trees on Apollonian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in Apollonian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree profile and weight in Apollonian networks and <i>k</i>-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tower of Hanoi – Myths and Maths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Combinatorial Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and classification of Sierpiński-type graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimer–monomer model on the Towers of Hanoi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimer coverings on the Sierpinski gasket / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration problems for classes of self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes on the towers of Hanoi graph / 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: 1-perfect codes in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes and \(L(2,1)\)-labelings in Sierpiński graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2017.08.024 / rank
 
Normal rank

Latest revision as of 02:43, 11 December 2024

scientific article
Language Label Description Also known as
English
Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
scientific article

    Statements

    Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (English)
    0 references
    0 references
    0 references
    0 references
    7 November 2017
    0 references
    maximum matching
    0 references
    minimum dominating set
    0 references
    Apollonian network
    0 references
    tower of Hanoi graph
    0 references
    matching number
    0 references
    domination number
    0 references
    complex network
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references