A Study of Node Search Spanning Tree Problem On Unicyclic Graph
碩士 === 國立東華大學 === 資訊工程學系 === 105 === The node searching problem on a graph G is to determine the minimum number of searchers to clear G via rules of node searching. This minimum number is called the node-search number of G. The node searching spanning tree problem on graph G is to find a spanning tr...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/2hyew2 |