Minimum Linear Arrangement of Generalized Sierpinski Graphs

Authors

  • Sundara Rajan R
  • Berin Greeni A
  • Leo Joshwa P

DOI:

https://doi.org/10.7155/jgaa.00644

Abstract

The creation of scientific supercomputers is one of the most pressing issues confronting technology today. Experts in computer science anticipate that future supercomputers will be built on large-scale parallel processing. A system with multiple processors and memories will be used in such a computer. The interconnection network that allows communication between the system’s processors and memories is a critical component of such systems. In the topic of interconnection networks for parallel computer architectures, graph embedding problems have grown in relevance. Network embedding has been recognized as a valuable method for developing efficient algorithms and simulating various architectures in parallel and distributed computing. In this paper, we obtain the maximum subgraph of the generalized Sierpinski graphs $S(n, m), n\geq 2, m\geq 3$, and calculate the minimum linear arrangement of generalized Sierpinski graphs by graph embeddings.

Downloads

Download data is not yet available.

Downloads

Published

2024-03-16

How to Cite

R, S. R., A, B. G., & P, L. J. (2024). Minimum Linear Arrangement of Generalized Sierpinski Graphs. Journal of Graph Algorithms and Applications, 27(9), 767–782. https://doi.org/10.7155/jgaa.00644

Issue

Section

Articles

Categories