scientific article; zbMATH DE number 7250384

zbMath1463.05521MaRDI QIDQ5121937

N. Parthiban, T. M. Rajalaxmi, A. Arul Shantrinal, R. Sundara Rajan, Joseph F. Ryan

Publication date: 22 September 2020

Full work available at URL: http://www.dmlett.com/archive/DML20_v3_50_56.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

embeddingwirelengthchord graphwindmill graphnecklace graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding of hypercubes into necklace, windmill and snake graphs
• An optimal time algorithm for minimum linear arrangement of chord graphs
• Embedding of tori and grids into twisted cubes
• On embedding subclasses of height-balanced trees in hypercubes
• Exact wirelength of hypercubes on a grid
• An edge-isoperimetric problem for powers of the Petersen graph
• Optimal linear arrangements using betweenness variables
• Wirelength of embedding complete multipartite graphs into certain graphs
• Minimum linear arrangement of chord graphs
• Improved Bound for Dilation of an Embedding onto Circulant Networks
• Efficient Embeddings of Trees in Hypercubes
• Efficient embeddings of grids into grids
• Embedding complete trees into the hypercube

This page was built for publication: