Let G be a group acting symmetrically on a graph 2, let G, be a subgroup of G minimal among those that act symmetrically on 8, and let G2 be a subgroup of G, maximal among those normal subgroups of GI which contain no member except 1 which fixes a vertex of Z. The most precise result of this paper i
β¦ LIBER β¦
Vertex-symmetric generalized Moore graphs
β Scribed by Michael Sampels
- Book ID
- 104294224
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 196 KB
- Volume
- 138
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
β¦ Synopsis
The transmission of a connected graph G is deΓΏned as the sum of all distances in G. A lower bound for the transmission, which can be regarded as a generalization of the Moore bound, was derived by Cerf et al. Graphs with a transmission attaining this bound are called generalized Moore graphs. Using techniques founded on Cayley graphs, we constructed vertex-symmetric generalized Moore graphs.
π SIMILAR VOLUMES
Vertex-transitive graphs: Symmetric grap
β
Peter Lorimer
π
Article
π
1984
π
John Wiley and Sons
π
English
β 642 KB
Generalized vertex covering in interval
β
Madhav V. Marathe; R. Ravi; C. Pandu Rangan
π
Article
π
1992
π
Elsevier Science
π
English
β 628 KB
Symmetric vertex models on planar random
β
D.A. Johnston
π
Article
π
1999
π
Elsevier Science
π
English
β 108 KB
Computer generation of vertex graphs
β
N.S. Sridharan
π
Article
π
1974
π
Elsevier Science
π
English
β 870 KB
Vertex-symmetric graphs with preassigned
β
D. V. Znoiko
π
Article
π
1983
π
SP MAIK Nauka/Interperiodica
π
English
β 175 KB
Hamiltonian paths in vertex-symmetric gr
β
Dragan MaruΕ‘iΔ; T.D. Parsons
π
Article
π
1982
π
Elsevier Science
π
English
β 673 KB