en
Master
English

The Picard Group of a complete bipartite graph

ContributorsKalustova, Inna
Defense date2016
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.

eng
Keywords
  • Picard Group
  • Critical group
  • Complete bipartite graphs
  • Invariant factors
  • Smith normal form
  • Growth series
Citation (ISO format)
KALUSTOVA, Inna. The Picard Group of a complete bipartite graph. 2016.
Main files (1)
Master thesis
accessLevelRestricted
Identifiers
  • PID : unige:85709
88views
16downloads

Technical informations

Creation07/14/2016 10:35:00 PM
First validation07/14/2016 10:35:00 PM
Update time03/15/2023 12:36:17 AM
Status update03/15/2023 12:36:17 AM
Last indexation01/29/2024 8:46:56 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack