Embedding connected double-loop networks with even cardinality in books

DOI10.1016/J.AML.2009.01.059MaRDI QIDQ1033043zbMATH OpenOpenAlexFDO

Authors Weihua Yang, Jixiang 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)

Recommendations

• Embedding connected double-loop networks with odd cardinality in books
• On the page number of triple-loop networks with even cardinality.
• Embedding Cartesian product of n paths and n cycles in books
• Embedding generalized Petersen graph in books
• Embedding Cartesian product of some graphs in books

Cites work

• A complementary survey on double-loop networks
• A genetic algorithm for finding the pagenumber of interconnection networks
• Degree constrained book embeddings
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Embedding the incomplete hypercube in books
• Graph theory
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 1507238 (Why is no real title available?)
• On Crossing Sets, Disjoint Sets, and Pagenumber
• On the pagenumber of complete bipartite graphs
• Optimum embedding of complete graphs in books
• The pagenumber of the class of bandwidth-k graphs is k-1

Cited in

(5)

• A survey on book-embedding of planar graphs
• Book embedding of complex network with community structure
• Embedding connected double-loop networks with odd cardinality in books
• Embedding generalized Petersen graph in books
• Using Euler’s Formula to Find the Lower Bound of the Page Number

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

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