The Crossing Number of the Circulant Graph C
| Main Authors: | Jing Wang, Yuanqiu Huang |
|---|---|
| Format: | Article Journal |
| Terbitan: |
, 2017
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/823505 |
Daftar Isi:
- A graph G = (V,E) is a set V of vertices and a subset E of unordered pairs of vertices, called edges. A Smarandache drawing of a graph G is a drawing of G on the plane with minimal intersections for its each component.