A plane graph is called symmetric if it is invariant under the reflection across some straight line. We prove a result that expresses the number of perfect matchings of a large class of symmetric graphs in terms of the product of the number of matchings of two subgraphs. When the graph is also centr
Critical groups of graphs with reflective symmetry
β Scribed by Andrew Berget
- Book ID
- 120668488
- Publisher
- Springer
- Year
- 2013
- Tongue
- English
- Weight
- 526 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0925-9899
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The symmetry groups of all trees are shown to be expressible as generalized wreath products by a tree pruning algorithm. The symmetry groups of certain cyclic graphs which can be expresssed as generalized compositions are also shown to be generalized wreath products. The symmetry groups
## Abstract A perfect colouring Ξ¦ of a simple undirected connected graph __G__ is an edge colouring such that each vertex is incident with exactly one edge of each colour. This paper concerns the problem of representing groups by graphs with perfect colourings. We define groups of graph automorphis
We consider the following class of unitary representations ? of some (real) Lie group G which has a matched pair of symmetries described as follows: (i) Suppose G has a period-2 automorphism {, and that the Hilbert space H(?) carries a unitary operator J such that J?=(? b {) J (i.e., selfsimilarity)