Folding wheels and fans
If two non-adjacent vertices of a connected graph that have a common neighbor are identified and the resulting multiple edges are reduced to simple edges, then we obtain another graph of order one less than that of the original graph. This process can be repeated until the resulting graph is complet...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2002
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/3621 https://animorepository.dlsu.edu.ph/context/faculty_research/article/4623/type/native/viewcontent/s003730200058.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |