Jacobian group of Cocktail Party

AuthorsMojtaba Bahramian
Conference TitleThe Second Conference on Computational Group Theory, Computational Number Theory and Applications
Holding Date of Conference2015-10-13
Event PlaceKashan
PresentationSPEECH
Conference LevelInternal Conferences

Abstract

The Jacobian group of a connected graph is a finite abelian group, whose order is the number of spanning trees of the graph. The structure of this group has been determined for some graphs. In this paper we find the structure of the Jacobian group for a family of graphs, called cocktail party