Recognizing generalized Sierpiński graphs (Q4988984): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong metric dimension of generalized Sierpiński graphs with pendant vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distances in generalized Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3451440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tower of Hanoi / 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: 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 – Myths and Maths / 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: The average eccentricity of Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / 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: Connectivity and some other properties of generalized Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractals and Universal Spaces in Dimension Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution of the isomorphism problem for circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3073555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the roman domination number of generalized Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279136 / rank
 
Normal rank

Latest revision as of 19:12, 25 July 2024

scientific article; zbMATH DE number 7350098
Language Label Description Also known as
English
Recognizing generalized Sierpiński graphs
scientific article; zbMATH DE number 7350098

    Statements

    Recognizing generalized Sierpiński graphs (English)
    0 references
    0 references
    0 references
    20 May 2021
    0 references
    generalized Sierpiński graphs
    0 references
    Sierpiński graphs
    0 references
    algorithm
    0 references

    Identifiers