http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : K. IYAPPAN (검색결과 1 건)
- 무료
- 기관 내 무료
- 유료
-
The forcing connected vertex monophonic number of a graph
P. Titus,K. IYAPPAN 장전수학회 2016 Advanced Studies in Contemporary Mathematics Vol.26 No.1
For any vertex x in a connected graph G of order p ≥ 2, a set Sx ⊆ V(G) is an x-monophonic set of G if each vertex v ∈ V(G) lies on an x - y monophonic path for some element y in Sx. The minimum cardinality of an x-monophonic set of g is the x-monophonic set of G is an x-monophonic set Sx such that the subgraph G[Sx]induced by Sx is connected. The minimum cardinality of a connected x-monophonic set of G is defined as the connected x-monophonic number of G and is denoted by cmx(G). A subset T of a minimum connected x-monophonic set Sx of G is called an x-forcing subset for Sx if Sx is the unique minimum connected x-monophonic set containing T. An x-forcing subset for Sx of minimum cardinality is a minimum x-forcing subset of Sx. The forcing connected x-monophonic number of Sx, denoted by fcmx(Sx), is the cardinality of a minimum x-forcing subset for Sx. The forcing connected x-monophonic number of G is fcmx (G) = min {fcmx (Sx)}, where the minimum is taken over all minimum connected x-monophonic sets Sx in G. We determine bounds for it and find the forcing connected vertex monophonic number for some special classes of graphs. For any two positive integers a and b with 0≤ a < b-1, there exists a connected graph G with fcmx(G) = a and cmx (G) =b for some vertex x in G.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
