Graphs associated with a group
HTML articles powered by AMS MathViewer
- by R. J. Plemmons
- Proc. Amer. Math. Soc. 25 (1970), 273-275
- DOI: https://doi.org/10.1090/S0002-9939-1970-0263705-2
- PDF | Request permission
Abstract:
It is shown that every group is isomorphic to a maximal group of graphs under the operation of graph product. In addition, maximal groups associated with an order graph are investigated.References
- C. C. Chang and A. Ehrenfeucht, A characterization of abelian groups of automorphisms of a simply ordering relation, Fund. Math. 51 (1962/63), 141–147. MR 142629, DOI 10.4064/fm-51-2-141-147
- P. M. Cohn, Groups of order automorphisms of ordered sets, Mathematika 4 (1957), 41–50. MR 91280, DOI 10.1112/S0025579300001078
- Roberto Frucht, On the construction of partially ordered systems with a given group of automorphisms, Rev. Un. Mat. Argentina 13 (1948), 12–18 (Spanish). MR 23821 C. Goffman, The group of similarity transforms of a simply ordered set, Bull. Amer. Math. Soc. 60 (1954), 289.
- Robert L. Hemminger, On the group of a directed graph, Canadian J. Math. 18 (1966), 211–220. MR 184875, DOI 10.4153/CJM-1966-023-2
- Oystein Ore, Theory of graphs, American Mathematical Society Colloquium Publications, Vol. XXXVIII, American Mathematical Society, Providence, R.I., 1962. MR 0150753
Bibliographic Information
- © Copyright 1970 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 25 (1970), 273-275
- MSC: Primary 05.62
- DOI: https://doi.org/10.1090/S0002-9939-1970-0263705-2
- MathSciNet review: 0263705