Embedding connected double-loop networks with even cardinality in books

DOI10.1016/j.aml.2009.01.059zbMath1173.05327OpenAlexW2023896948MaRDI QIDQ1033043

Weihua Yang, Ji Xiang Meng

Publication date: 6 November 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.01.059

zbMATH Keywords

double-loop networksinterconnection networkpagenumber

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Embedding generalized Petersen graph in books ⋮ A survey on book-embedding of planar graphs ⋮ Book embedding of complex network with community structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The pagenumber of the class of bandwidth-k graphs is \(k-1\)
• Embedding the incomplete hypercube in books
• Optimum embedding of complete graphs in books
• On the pagenumber of complete bipartite graphs
• A genetic algorithm for finding the pagenumber of interconnection networks
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Degree constrained book embeddings
• On Crossing Sets, Disjoint Sets, and Pagenumber
• A complementary survey on double-loop networks

This page was built for publication: Embedding connected double-loop networks with even cardinality in books