The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Coloring and Counting on the Tower of Hanoi Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p,1)\)-total labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136012 / 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: On \((d,1)\)-total numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A statistical analysis of the towers of hanoi problem / 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: Q3565864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring a graph frugally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pascal's Triangle and the Tower of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tower of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the planarity of Hanoi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Hanoi and Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average eccentricity of 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 / cites work
 
Property / cites work: Vertex-, edge-, and total-colorings of Sierpiński-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hub number of Sierpiński-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Wiener index of Sierpiński-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric properties of Sierpiński-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3073555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4786551 / 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: 1-perfect codes in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Paths in the Tower of Hanoi Graph and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear \(t\)-colorings of Sierpiński-like graphs / rank
 
Normal rank

Latest revision as of 06:59, 21 July 2024

scientific article
Language Label Description Also known as
English
The \((d, 1)\)-total labelling of Sierpiński-like graphs
scientific article

    Statements

    The \((d, 1)\)-total labelling of Sierpiński-like graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2019
    0 references
    0 references
    \((d
    0 references
    1)\)-total number
    0 references
    Sierpiński graph \(s(n
    0 references
    k)\)
    0 references
    Sierpiński gasket graph \(s(n)
    0 references
    s^+(n
    0 references
    k)
    0 references
    s^{+ +}(n
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references