Embedding of extended Sierpinski networks S^++(k, m) into certain trees

DOI10.1051/RO/2025085MaRDI QIDQ6907112zbMATH OpenFDO

Authors P. Leo Joshwa, Sundara R. Rajan, T. M. Rajalaxmi, Ismail Naci Cangül

Publication date 4 November 2025

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2025085

zbMATH Keywords

embeddinglinear arrangementmaximum subgraph problemtreeswirelength

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A linear time algorithm for embedding Christmas trees into certain trees
• A survey and classification of Sierpiński-type graphs
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• Crossing numbers of Sierpiński‐like graphs
• Embedding height balanced trees and Fibonacci trees in hypercubes
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Embedding of hypercube into fractal cubic network
• Embeddings of circulant networks
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
• Exact wirelength of hypercubes on a grid
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303526 (Why is no real title available?)
• Linear wirelength of folded hypercubes
• Maximum subgraph problem for 3-regular Knödel graphs and its wirelength
• Minimum Linear Arrangement of Generalized Sierpinski Graphs
• Operations of interlaced trees and graceful trees
• Optimal Assignments of Numbers to Vertices
• Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Wirelength of embedding complete multipartite graphs into certain graphs

Cited in

(2)

• Maximum subgraph and wirelength analysis of extended Sierpiński networks in parallel computing
• Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures

This page was built for publication: Embedding of extended Sierpinski networks \(S^{++}(k, m)\) into certain trees

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