zenodoopen
Edge Detour Graphs with Edge Detour Number 2
<p>By a graph G = (V,E), we mean a finite undirected graph without loops or multiple edges. The order and size of G are denoted by p and q respectively. For basic definitions and terminologies, we refer to [1], [6].</p>
ShareScore
36/100
Overall dataset sharing score
Score breakdown
These five areas show where the dataset supports — or may limit — practical reuse.
- Stewardship
- 8
- Harmonization
- 4
- Access
- 16
- Reuse readiness
- 8
- Engagement
- 0
Topics
Dataset details
- Repository
- zenodo
- Published
- April 14, 2009
- License
- cc-by-4.0
- DOI
- 10.5281/zenodo.809369
Scored with release 0.9.0
ScienceDex for faculty
Your academic CV and NIH biosketch
Make your CV in your school's format and your NIH biosketch from it, then download both as Word files.