Name
Abstract | ||
|---|---|---|
For any finite 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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.endm.2007.07.031 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Addition Cayley Graphs,Connectivity,Critical pairs,Kemperman Structure Theorem | Discrete mathematics,Combinatorics,Vertex-transitive graph,Cayley table,Cayley graph,Cycle graph,Word metric,Symmetric graph,Connectivity,Voltage graph,Mathematics | Journal |
Volume | ISSN | Citations |
29 | 1571-0653 | 2 |
PageRank | References | Authors |
0.58 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David J. Grynkiewicz | 1 | 42 | 10.33 |
| Vsevolod F. Lev | 2 | 37 | 17.97 |
| Oriol Serra | 3 | 147 | 28.05 |