(4, d)-Sigraph and Its Applications

다국어 초록 (Multilingual Abstract)

Let G = (V,E) be a graph. By directional labeling (or d-labeling) of an edge x = uv of G by an ordered 4-tuple (a1, a2, a3, a4), we mean a labeling of the edge x such that we consider the label on uv as (a1, a2, a3, a4) in the direction from u to v, and the label on x as (a4, a3, a2, a1) in the direction from v to u. In this paper, we study graphs, called (4, d)-sigraphs, in which every edge is d-labeled by a 4-tuple (a1, a2, a3, a4), where ak 2 {+, −},for 1 ≤ k ≤ 4. Giving a motivation to study such graphs, we obtain some results by introducing new notions of balance and special types of complementations.

참고문헌 (Reference)

1 F.Harary, "Structural models: An introduction to the theory of directed graphs" J. Wiley 1965

2 T. Zaslavsky, "Signed Graphs" 4 (4): 47-74, 1982

3 F. Harary, "On the notion of balance of a signed graph" 2 : 143-146, 1953

4 B.D. Acharya, "New algebraic models of a Social System" 17 (17): 152-168, 1986

5 T. Zaslavsky, "Mathematical bibliography of Signed and Gain graphs and its allied areas" 8 (8): 1998

6 E. Sampathkumar, "Group Valued graphs" 18 : 325-328, 1973

7 F. Harary, "Graph Theory" Addison-Wesley Publishing Co. 1969

8 E. Sampathkumar, "Generalized Graph Structures" 3 (3): 67-123, 2006

9 E. Sampathkumar, "Directionally n-signed graphs" 2008

10 E. Sampathkumar, "(3,d)-sigraph and its applications" 장전수학회 17 (17): 57-67, 2008