ON A CLASS OF FIXED-POINT-FREE GRAPHS1

@inproceedings{Sabidussi2010ONAC,
  title={ON A CLASS OF FIXED-POINT-FREE GRAPHS1},
  author={Gert Sabidussi},
  year={2010}
}
A number of papers [l; 2; 3; 4] have dealt with the construction of finite graphs X whose automorphism group G(X) is isomorphic to a given finite group G. Examination of the graphs constructed in these papers shows the following two facts. (1) The graphs X have the property that for any two vertices x and y of X there is at most one 4>EG(X) which sends x into y ((1) is precisely the fact which is used in [l] and [2] to prove that G(X) actually is isomorphic to G). (2) The graphs X are… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

52 Citations

051015'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Herstellung von Graphen mil vorgegebener abstrakter Gruppe

  • R. Frucht
  • Compositio Math. vol
  • 1938
Highly Influential
6 Excerpts

Graphen 3., 4. und 5. Grades mil vorgegebenen abstrakten Automorphismengruppen, Farbenzahlen und Zusammenhangen

  • H. Izbicki
  • Monatsh. Math. vol
  • 1957

Graphs with given group and given graph theoretical properties, Canad

  • G. Sabidussi
  • J. Math. vol
  • 1957