UNIGE document Master
previous document  unige:85709  next document
add to browser collection
Title

The Picard Group of a complete bipartite graph

Author
Director
Defense Maîtrise : Univ. Genève, 2016
Abstract The Picard Group of a finite connected graph is a finite abelian group of order equal to the number of spanning trees of the graph. The Picard Group can be defined in a several different ways, which we consider in this paper. We determine this group for complete bipartite graphs.
Keywords Picard GroupCritical groupComplete bipartite graphsInvariant factorsSmith normal formGrowth series
Note 5,5
Full text
Master (378 Kb) - document accessible for UNIGE members only Limited access to UNIGE
Structures
Citation
(ISO format)
KALUSTOVA, Inna. The Picard Group of a complete bipartite graph. Université de Genève. Maîtrise, 2016. https://archive-ouverte.unige.ch/unige:85709

20 hits

3 downloads

Update

Deposited on : 2016-08-08

Export document
Format :
Citation style :