๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the group and the circuit group of a graph

โœ Scribed by Steve Gallant

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
205 KB
Volume
6
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

A relation between the group and the circuit group of a graph is given.

๐Ÿ“œ SIMILAR VOLUMES

The group and the minimal polynomial of
The group and the minimal polynomial of a graph
โœ Giovanni Criscuolo; Chung-Mo Kwok; Abbe Mowshowitz; Roberto Tortora ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 636 KB
On the Sandpile Group of Dual Graphs
On the Sandpile Group of Dual Graphs
โœ Robert Cori; Dominique Rossin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 205 KB

The group of recurrent configurations in the sandpile model, introduced by Dhar [7], may be considered as a finite abelian group associated with any graph G; we call it the sandpile group of G. The aim of this paper is to prove that the sandpile group of planar graph is isomorphic to that of its dua

Automorphism group and diameter of a gra
Automorphism group and diameter of a graph
โœ P. Dankelmann; D. Erwin; S. Mukwembi; B. G. Rodrigues; E. Mwambene; G. Sabidussi ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 178 KB ๐Ÿ‘ 1 views

## Abstract Given a connected graph ฮ“ of order __n__ and diameter __d__, we establish a tight upper bound for the order of the automorphism group of ฮ“ as a function of __n__ and __d__, and determine the graphs for which the bound is attained. ยฉ 2011 Wiley Periodicals, Inc. J Graph Theory.