http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : S. Athisayanathan (검색결과 1 건)
- 무료
- 기관 내 무료
- 유료
-
Edge-to-vertex detour number of a graph
A. P. Santhakumaran,S. Athisayanathan 장전수학회 2011 Advanced Studies in Contemporary Mathematics Vol.21 No.4
For two vertices u and v in a graph G = (V,E), the detour distance D(u, v)is the length of a longest u–v path in G. A u–v path of length D(u, v) is called a u–v detour. For subsets A and B of V , the detour distance D(A,B)is defined as D(A,B) = min{D(x, y) : x ∈ A, y ∈ B}. A u–v path of length D(A,B) is called an A–B detour joining the sets A, B ⊆ V where u ∈ A and v ∈ B. A vertex x is said to lie on an A–B detour if x is a vertex of an A–B detour. A set S ⊆ E is called an edge-to-vertex detour set if every vertex of G is incident with an edge of S or lies on a detour joining a pair of edges of S. The edge-to-vertex detour number dn_2(G) of G is the minimum order of its edge-to-vertex detour sets and any edge-to-vertex detour set of order dn_2(G) is an edge-to-vertex detour basis of G. Certain general properties of these concepts are studied. The edge-to-vertex detour numbers of certain classes of graphs are determined. Its relationship with the detour diameter is discussed and it is proved that for each triple D, k, q of integers with 2 ≤ k ≤ q − D + 2 and D ≥ 4 there is a connected graph G of order p with detour diameter D and dn_2(G) = k. It is also proved that for any three positive integers a, b, k with k ≥ 2 and a < b ≤ 2a, there is a connected graph with detour radius a, detour diameter b and dn_2(G) = k.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
