Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Improved bounds on t ...
Article

Improved bounds on the crossing number of butterfly network

Paul D. Manuel (1), Bharati Rajan (2) (3), Indra Rajasingh (4), P. Vasanthi Beulah (5)
(1) Department of Information Science [Kuwait]
(2) Department of Mathematics [Chennai]
(3) School of Electrical Engineering and Computer Science
(4) School of Advanced Sciences (SAS) [Chennai]
(5) Department of Mathematics - Queen Mary's College [Chennai]
Download article
Open on HAL
Imported on
January 27, 2011
Published on
May 17, 2013
Last modified on
March 31, 2025
Volume 15
vol. 15:2
Graph Theory
DOI
10.46298/dmtcs.611
License
https://about.hal.science/hal-authorisation-v1
Indicators
866
Views
1064
Downloads

Improved bounds on the crossing number of butterfly network

Paul D. Manuel (1), Bharati Rajan (2) (3), Indra Rajasingh (4), P. Vasanthi Beulah (5)
(1) Department of Information Science [Kuwait]
(2) Department of Mathematics [Chennai]
(3) School of Electrical Engineering and Computer Science
(4) School of Advanced Sciences (SAS) [Chennai]
(5) Department of Mathematics - Queen Mary's College [Chennai]
Abstract
We draw the r-dimensional butterfly network with 1 / 44r+O(r2r) crossings which improves the previous estimate given by Cimikowski (1996). We also give a lower bound which matches the upper bound obtained in this paper.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Cited by

Source: OpenCitations

  • Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks

    Applied Mathematics and Computation

    Authors : S. Prabhu ORCID, V. Manimozhi, M. Arulperumjothi, Sandi Klavžar ORCID

    Journal reference : Volume 420, 2022, pp. 126897

    DOI : 10.1016/j.amc.2021.126897
Preview
Loading PDF preview...