On the crossing numbers of loop networks and generalized Petersen graphs

DOI10.1016/J.DISC.2004.07.036MaRDI QIDQ2575797zbMATH OpenOpenAlexFDO

Authors Gelasio Salazar

Publication date 6 December 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.07.036

zbMATH Keywords

interconnection networkcirculantVLSI layoutloop network

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 3957138
• The crossing number of the generalized Petersen graph \(P [3k - 1,k]\)
• The crossing numbers of generalized Petersen graphs with small order
• The crossing number of \(C(n;\{1,\lfloor n/2\rfloor-1\})\)
• On the crossing number of the generalized Petersen graph \(P(3k,k)\).

Cites work

• scientific article; zbMATH DE number 3957138 (Why is no real title available?)
• scientific article; zbMATH DE number 19191 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 146672 (Why is no real title available?)
• scientific article; zbMATH DE number 1151834 (Why is no real title available?)
• scientific article; zbMATH DE number 1472117 (Why is no real title available?)
• scientific article; zbMATH DE number 2145245 (Why is no real title available?)
• scientific article; zbMATH DE number 1359487 (Why is no real title available?)
• scientific article; zbMATH DE number 3446923 (Why is no real title available?)
• scientific article; zbMATH DE number 2108147 (Why is no real title available?)
• A combinatorial problem related to distributed loop networks
• A framework for solving VLSI graph layout problems
• A successful concept for measuring non-planarity of graphs: The crossing number.
• Arrangements, circular arrangements and the crossing number of \(C_{7} \times C_{n}\).
• Circulants and their connectivities
• Crossing Number Problems
• Crossing numbers of sequences of graphs II: Planar tiles
• Crossing-number critical graphs have bounded path-width
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• Minimal diameter double-loop networks: Dense optimal families
• On the crossing numbers of certain generalized Petersen graphs
• The crossing number of K5,n
• The crossing number of \(P(N,3)\)
• The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)
• The crossing numbers of some generalized Petersen graphs.

Cited in

(15)

• Unexpected behaviour of crossing sequences
• Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
• On the page number of triple-loop networks with even cardinality.
• The crossing number of \(C(n; \{1,3\})\)
• On the minimum vertex cover of generalized Petersen graphs
• The crossing numbers of generalized Petersen graphs with small order
• A survey of graphs with known or bounded crossing numbers
• The crossing number of chordal ring networks
• Computing the zero forcing number for generalized Petersen graphs
• scientific article; zbMATH DE number 3957138 (Why is no real title available?)
• Distance-balanced graphs: symmetry conditions
• The crossing number of locally twisted cubes \(L T Q_n\)
• The crossing number of \(C(n;\{1,\lfloor n/2\rfloor-1\})\)
• An upper bound for the crossing number of augmented cubes
• Skewness of generalized Petersen graphs and related graphs

This page was built for publication: On the crossing numbers of loop networks and generalized Petersen graphs

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