Distance Pattern Distinguishing Sets in Graphs
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Let G = (V,E) be a connected graph and let M be a nonempty subset of V. For any vertex u, the set f_M(u) = {d(u, v) : v ∈ M} is called the Mdistance pattern of u. The set M is called a distance pattern distinguishing set or simply DPD-set if the function fM is injective. A graph that admits a DPD-set is called a DPD-graph. In this paper we present a few basic properties of DPD-graphs.
Abstract
Let G = (V,E) be a connected graph and let M be a nonempty subset of V. For any vertex u, the set f_M(u) = {d(u, v) : v ∈ M} is called the Mdistance pattern of u. The set M is called a distance pattern distinguishing set or simply DPD-set if the function fM is injective. A graph that admits a DPD-set is called a DPD-graph. In this paper we present a few basic properties of DPD-graphs.
참고문헌 (3)
- F.Harary, "Graph Theory" (1969), Addison Wesley
- P.J. Slater, "Leaves of trees", Congr. Numer, 14, pp.549~559 (1975)
- F. Harary, "On metric dimension of graphs", Ars Combin, 2, pp.191~195 (1976)