On cycle bases of a graph
暂无分享，去创建一个
The paper deals with bases of the vector space associated with a graph. Section 2 presents two characterizations of the cycle basis which can be derived from a spanning t ree of a graph, and Section 3 contains the counterexamples for the conjecture of Dixon and Goodman. Finally, some nev problems are posed.
[1] Frank Harary,et al. Graph Theory , 2016 .
[2] S. E. Goodman,et al. An algorithm for the longest cycle problem , 1976, Networks.
[3] Narsingh Deo,et al. On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..
[4] E. Kolasińska. On a minimum cycle basis of a graph , 1980 .