Minimum Linear Arrangement of Generalized Sierpinski Graphs (Q6181951): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: General edge-isoperimetric inequalities. I: Information-theoretical methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex partitions with 2-edge connected dual graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal linear arrangements using betweenness variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding equitable convex partitions of points in a polygon efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / 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: Coloring Sierpiński graphs and Sierpiński gasket graphs / 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: Crossing numbers of Sierpiński‐like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of solved problems and applications on bandwidth, edgesum, and profile of 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: Exact wirelength of hypercubes on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings Between Hypercubes and Hypertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength / rank
 
Normal rank

Latest revision as of 16:41, 21 August 2024

scientific article; zbMATH DE number 7781099
Language Label Description Also known as
English
Minimum Linear Arrangement of Generalized Sierpinski Graphs
scientific article; zbMATH DE number 7781099

    Statements

    Minimum Linear Arrangement of Generalized Sierpinski Graphs (English)
    0 references
    20 December 2023
    0 references

    Identifiers