DocumentCode :
1186788
Title :
On the fundamental cycle set graph
Author :
Syslo, Maciej M.
Volume :
29
Issue :
3
fYear :
1982
fDate :
3/1/1982 12:00:00 AM
Firstpage :
136
Lastpage :
138
Abstract :
We prove that there exists a one-to-one correspondence between the spanning trees and the fundamental cycle sets of a graph 
if and only if is 3-edge connected. Then we define a fundamental cycle set graph and prove that such a graph is a tree graph. It follows, therefore, that every fundamental cycle set graph on at least three vertices is Hamiltonian.
if and only if is 3-edge connected. Then we define a fundamental cycle set graph and prove that such a graph is a tree graph. It follows, therefore, that every fundamental cycle set graph on at least three vertices is Hamiltonian.Keywords :
General analysis and synthesis methods; Graph theory; Character generation; Computer science; Tree graphs;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1982.1085125
Filename :
1085125
Link To Document :
