Minimum Linear Arrangement of Generalized Sierpinski Graphs

DOI10.7155/jgaa.00644OpenAlexW4388593937MaRDI QIDQ6181951

No author found.

Publication date: 20 December 2023

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00644

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• A survey and classification of Sierpiński-type graphs
• The hub number of Sierpiński-like graphs
• Convex partitions with 2-edge connected dual graphs
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• Exact wirelength of hypercubes on a grid
• General edge-isoperimetric inequalities. I: Information-theoretical methods
• Optimal linear arrangements using betweenness variables
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Embeddings Between Hypercubes and Hypertrees
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• 1-perfect codes in Sierpiński graphs
• An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
• Optimal Assignments of Numbers to Vertices
• Crossing numbers of Sierpiński‐like graphs

This page was built for publication: Minimum Linear Arrangement of Generalized Sierpinski Graphs