The Crossing Number of 4-Regular Graphs
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The CCN (calculate crossing number) algorithm using branch and bound method to calculate the crossing number of graph with small order is put forward to study the crossing number using computer. With the algorithm, the crossing number of all of the 4-regular graphs Aac(n) for n≤12 and the crossing number of some random 4-regular graphs Arc(n) for n≤16 are calculated. At the end of the paper, the average crossing number is shown, and a conjecture is given that the average crossing number of 4-regular graph is O(n2).

    Reference
    Related
    Cited by
Get Citation

杨元生,王丹,陆维明.四正则图的交叉数.软件学报,2002,13(12):2259-2266

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 17,2001
  • Revised:August 27,2001
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063