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

Notions of balance in symmetric n-sigraphs

1

조회

0

다운로드

5

인용

0

참고문헌

키워드

주제분류수학

초록

An n−tuple (a₁, a₂, . . . , an) is symmetric (more pricisely palindromic), if ak = an−k+₁, 1 ≤ k ≤ n. A symmetric n-sigraph is an ordered pair Sn = (G, δ), where G = (V,E) is a graph called the underlying graph of Sn and δ : E → Hn is a function. In this paper, we obtain some results by introducing few notions of balance in symmetric n-sigraphs.

Abstract

An n−tuple (a₁, a₂, . . . , an) is symmetric (more pricisely palindromic), if ak = an−k+₁, 1 ≤ k ≤ n. A symmetric n-sigraph is an ordered pair Sn = (G, δ), where G = (V,E) is a graph called the underlying graph of Sn and δ : E → Hn is a function. In this paper, we obtain some results by introducing few notions of balance in symmetric n-sigraphs.

참고문헌 (9)

  1. B. D. Acharya, "New algebraic models of social system, Indian", J. of pure & Appl. math, 17(2), pp.152~168 (1986)
  2. J. A. Davis, "Clustering and Structural Balance in Graphs", Human Relations, 20, pp.181~187 (1967)
  3. C. Flament, "Applications of Graph Theory to Group Structure" (1963), Prentice-hall, Inc., New Jersey
  4. F. Harary, "Graph Theory" (1969), Addison-wesely, Massachusethes
  5. F. Harary, "on the notion of balance of a signed graph", Michigan Math. J, 2, pp.143~146 (1953)
  6. F. Harary, "on local balance and n-balance of a signed graph", Michigan Math. J, 3, pp.37~41 (1955)
  7. E. Sampathkumar, "Point signed and line signed graphs", Nat. Acad.sci. letters, 7(3), pp.91~93 (1984)
  8. T. Zaslavsky, "Signed Graphs", Discrete Appl. Math, 4(1), pp.47~74 (1982)
  9. T. Zaslavsky, "A Mathematical bibliography of signed and Gain graphs and its allied areas", Electronic J. Combinatorics, 8(1), pp.124~ (1998)

관련 논문AI추천

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