On cycle bases of a graph

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 1979 English Publisher:WileyJournal:Networks, volume 9, pages 123-132 (issn: 0028-3045, eissn: 1097-0037,

Copyright policy )

Authors: Maciej M. Syslo;

doi: 10.1002/net.3230090203

On cycle bases of a graph

- Summary
- Subjects
- Metrics

Abstract

AbstractThe 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.

Related Organizations

University of Wrocław
Poland

Keywords

Graph theory, spanning tree, Vector spaces, linear dependence, rank, lineability, vector space associated with a graph, cycle basis, Trees

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	26
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average