Minimum Linear Arrangement of Generalized Sierpinski Graphs

DOI10.7155/JGAA.00644MaRDI QIDQ6181951zbMATH OpenOpenAlexFDO

Authors

Publication date 20 December 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Recommendations

• Graph embedding and interconnection networks
• Embedding of recursive circulants into certain necklace graphs
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
• On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
• Embedding complete multi-partite graphs into Cartesian product of paths and cycles

Cites work

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

Cited in

(6)

• A note on minimum linear arrangement for BC graphs
• Embedding of hypercube into fractal cubic network
• Maximum subgraph and wirelength analysis of extended Sierpiński networks in parallel computing
• Optimal layout of embedding onto folded hypercubes
• Embedding of extended Sierpinski networks \(S^{++}(k, m)\) into certain trees
• Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181951)