http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Gurunath Rao Vaidya (검색결과 1 건)
- 무료
- 기관 내 무료
- 유료
-
The Line n-Sigraph of a Symmetric n-Sigraph-II
P. Siva Kota Reddy,V. Lokesha,Gurunath Rao Vaidya 장전수학회 2010 Proceedings of the Jangjeon mathematical society Vol.13 No.3
An n-tuple (a1, a2, ..., an) is symmetric, if ak = an-k+1, 1 ≤ k ≤ n. Let Hn = {(a1, a2, ..., an) : ak ∈ {+, -}, ak = an-k+1, 1 ≤ k ≤ n} be the set of all symmetric n-tuples. A symmetric n-sigraph (symmetric n-marked graph) is an ordered pair Sn = (G, σ) (Sn = (G, μ)), where G = (V, E) is a graph called the underlying graph of Sn and σ : E → Hn (μ : V → Hn) is a function. Given a connected graph H of order at least 3, the H-Line Graph of a graph G = (V, E), denoted by HL(G), is a graph with the vertex set E, the edge set of G where two vertices in HL(G) are adjacent if, and only if, the corresponding edges are adjacent in G and there exists a copy of H in G containing them. Analogously, for a connected graph H of order at lest 3, we define the H-Line symmetric n-sigraph HL(Sn) of a symmetric n-sigraph Sn = (G, σ) as a symmetric n-sigraph, HL(Sn) = (HL(G), σ'),and for any edge e1e2 in HL(Sn), σ'(e1e2) = σ(e1)σ(e2). In this paper,we characterize symmetric n-sigraphs Sn which are H-line symmetric n-sigraphs and study some properties of H-line graphs as well as H-line symmetric n-sigraphs. The notion HL(Sn) which generalizes the notion of line symmetric n-sigraph L(Sn) introduced by E. Sampathkumar et al. (2010).
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
