The nucleus of a point determining graph
暂无分享,去创建一个
A graph is point determining if distinct points have distinct neighborhoods. In this paper we investigate the nucleus G^0={@[email protected]:[email protected] is point determining} of a point determining graph G. In particular, we characterize those graphs that are the nucleus of some connected point determining graph.
[1] Roger C. Entringer,et al. Line-critical point determining and point distinguishing graphs , 1974, Discret. Math..
[2] C. H. Randall,et al. Operational Statistics. I. Basic Concepts , 1972 .
[3] David P. Sumner. Point determination in graphs , 1973, Discret. Math..
[4] David P. Sumner. 1-Factors of point determining graphs , 1974 .
[5] David P. Sumner. Graphs indecomposable with respect to the X-join , 1973, Discret. Math..