Jacobian group of Cocktail Party

نویسندگانمجتبی بهرامیان
همایشThe Second Conference on Computational Group Theory, Computational Number Theory and Applications
تاریخ برگزاری همایش۲۰۱۵-۱۰-۱۳
محل برگزاری همایشکاشان
نوع ارائهسخنرانی
سطح همایشملی

چکیده مقاله

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.