شماره ركورد كنفرانس :
4380
عنوان مقاله :
Jacobian group of Cocktail Party
پديدآورندگان :
M. Bahramian bahramianh@kashanu.ac.ir Department of Pure Mathematics, Faculty of Mathematical Sciences,
University of Kashan, Kashan, I. R. Iran;
كليدواژه :
Graph , Jacobian of Graphs.
عنوان كنفرانس :
دومين كنفرانس جبر محاسباتي، نظريه محاسباتي اعداد و كاربردها
چكيده فارسي :
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.
