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: | , , |
---|---|
格式: | text |
出版: |
Animo Repository
2002
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/3621 https://animorepository.dlsu.edu.ph/context/faculty_research/article/4623/type/native/viewcontent/s003730200058.html |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!