| Mader, W.: Uber den Zusammenhang symmetrischer Graphen. Arch. Math. (Basel) 21 (1970) 331--336 |
....is the same as that of Cayley coset digraphs. For that reason, there has been a substantial effort to construct and analyze Cayley coset digraphs with good interconnection network properties [7, 5, 1] The connectivity properties of vertex transitive graphs were studied by Watkins [16] and Mader [12, 13]; and of digraphs by Hamidoune [8, 9, 10] Mader [13] showed that connected vertex transitive digraphs have optimal edge This work was performed under the auspices of the U.S. Department of Energy under Contract No. W 7405 ENG 36. connectivity. The first general results on the vertex ....
....connected vertex transitive digraphs have optimal edge This work was performed under the auspices of the U.S. Department of Energy under Contract No. W 7405 ENG 36. connectivity. The first general results on the vertex connectivity of connected vertex transitive graphs were obtained by Mader [12] and Watkins [16] They show that every connected edge and vertex transitive graph has optimal vertex connectivity (i.e. the vertex connectivity is the same as the degree) Mader [12, 13] shows that every connected vertex transitive graph without K 4 is optimally vertex connected. He also shows ....
[Article contains additional citation context not shown here]
W. Mader, Uber den Zusammenhang symmetrischer Graphen, Arch. Math. 21 (1970) 331--336.
No context found.
Mader, W.: Uber den Zusammenhang symmetrischer Graphen. Arch. Math. (Basel) 21 (1970) 331--336
No context found.
W. Mader. Uber den Zusammenhang symmetrischer Graphen. Arch. Math. (Basel), 21:331--336, 1970.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC