Hostname: page-component-848d4c4894-hfldf Total loading time: 0 Render date: 2024-05-23T09:05:08.825Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on 1-factors of point determining graphs

Published online by Cambridge University Press:  17 April 2009

Chia Gek-Ling  and
Lim Chong-Keang
Chia Gek-Ling
Affiliation:
Department of Mathematics, University of Malaya, Kuala Lumpur 22–11, Malaysia.
Lim Chong-Keang
Affiliation:
Department of Mathematics, University of Malaya, Kuala Lumpur 22–11, Malaysia.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A graph is called point determining if distinct points have distinct neighborhoods. In this note we provide a sufficient condition for a point determining graph to have a 1-factor. This is an extension of some results obtained by David P. Sumner.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 25 , Issue 2 , April 1982 , pp. 265 - 270
Copyright
Copyright © Australian Mathematical Society 1982

References

[1]Geoffroy, Dennis P., “On 1-factors of point determining graphs”, Discrete Math. 24 (1978), 167–175.CrossRefGoogle Scholar
[2]Harary, Frank, Graph theory (Addison-Wesley, Reading, Menlo Park, London, 1969).CrossRefGoogle Scholar
[3]Sumner, David P., “Point determination in graphs”, Discrete Math. 5 (1973), 179–187.CrossRefGoogle Scholar
[4]Sumner, David P., “1-factors of point determining graphs”, J. Combin. Theory Ser. B 16 (1974), 35–41.CrossRefGoogle Scholar