Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ENDM
2007

favoriteEmaildiscussreport

114views more ENDM 2007»

The Connectivity of addition Cayley graphs

13 years 4 months ago

The Connectivity of addition Cayley graphs

Download math.haifa.ac.il

For any ﬁnite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a special, explicitly described form.

David J. Grynkiewicz, Vsevolod F. Lev, Oriol Serra

Real-time Traffic

Addition Cayley Graph | ENDM 2007 | Minimum Vertex | ﬁnite Abelian Group |

claim paper

Related Content

» Neighbourhood Graphs of Cayley Graphs for Finitelygenerated Groups

» Routing permutations on graphs via matchings

» Automorphism groups with cyclic commutator subgroup and Hamilton cycles

» Parking Functions of Types A and B

» On Cayley Graphs on the Symmetric Group Generated by Tranpositions

» Integral Uniform Flows in Symmetric Networks

» Counting connected graphs asymptotically

» A Matrix Hyperbolic Cosine Algorithm and Applications

» Weak sense of direction labelings and graph embeddings

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ENDM
Authors	David J. Grynkiewicz, Vsevolod F. Lev, Oriol Serra

Comments (0)