본문 바로가기
KERD
논문KCI 등재

Bi-distance pattern uniform graphs

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

A graph G = (V;E) is Bi-Distance Pattern Uniform (Bi-DPU) if there existsM ⊆ V (G) such that the M-distance pattern fM(u) = {d(u, v) : v ∈ M} isidentical for all u in M and fM(v) is identical for all v in V\M. The set M iscalled a Bi-DPU set. In this paper, we initiate a study on Bi-DPU graphs.

Abstract

A graph G = (V;E) is Bi-Distance Pattern Uniform (Bi-DPU) if there existsM ⊆ V (G) such that the M-distance pattern fM(u) = {d(u, v) : v ∈ M} isidentical for all u in M and fM(v) is identical for all v in V\M. The set M iscalled a Bi-DPU set. In this paper, we initiate a study on Bi-DPU graphs.

참고문헌 (2)

  1. G.Chartrand, "Ping Zhang Introduction to Graph theory" (2005), McGraw-Hill
  2. funded by the Department of Science and Technology, , DST, ~, pp.DST grant-in-aid project No.SR (2009), S4[DOI]

관련 논문AI추천

이 간행물의 다른 논문 (14건)