Premium
On cycle bases of a graph
Author(s) -
Sysło M. M.
Publication year - 1979
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230090203
Subject(s) - counterexample , cycle basis , graph , conjecture , combinatorics , mathematics , basis (linear algebra) , graph factorization , vector space , spanning tree , computer science , discrete mathematics , line graph , voltage graph , graph power , pure mathematics , geometry
Abstract 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 tree of a graph, and Section 3 contains the counterexamples for the conjecture of Dixon and Goodman. Finally, some new problems are posed.