Abstract
A graph G is supercompact if and only if distinct vertices of G have distinct closed neighborhoods. The edge nucleus of G is the set of all edges e of G such that G-e is supercompact. Some results on the edge nucleus are presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Berge, Graphs and hypergraphs, North-Holland publishing Co., Amesterdam, 1973.
G. L. Chia and C. K. Lim, On supercompact graphs I: The nucleus, Research Report No. 8/82 August, University of Malaya 1982.
J. De Groot, Graph representation of topological spaces, Math. Centrum Amsterdam 52 (1974), 29–37.
R. C. Entringer and L. D. Gassman, Line-critical point determining and point distinguishing graphs, Discrete Math. 10 (1974), 43–55.
D. P. Geoffroy and D. P. Sumner, The edge nucleus of a point determining graph, J. Comb. Theory, Ser. B 24 (1978), 189–201.
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.
C. K. Lim, On supercompact graphs, J. Graph Theory, 2 (1978), 349–355.
D. P. Sumner, Point determination in graphs, Discrete Math. 5 (1973), 179–187.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Gek-Ling, C., Chong-Keang, L. (1984). On supercompact graphs III: The edge nucleus. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073100
Download citation
DOI: https://doi.org/10.1007/BFb0073100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13368-1
Online ISBN: 978-3-540-38924-8
eBook Packages: Springer Book Archive