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

ON STRONGLY SUM DIFFERENCE QUOTIENT GRAPHS

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

In this paper, we introduce the concept of strongly sum difference quotient (SSDQ) graph and show that much studied families of graphs such as cycles, flowers, wheels are SSDQ graphs. We give an upper bound for α(n), the maximum number of edges in a SSDQ graph of order n. Also we derive an explicit formula for α(n) in terms of Eulers phi function.

Abstract

In this paper, we introduce the concept of strongly sum difference quotient (SSDQ) graph and show that much studied families of graphs such as cycles, flowers, wheels are SSDQ graphs. We give an upper bound for α(n), the maximum number of edges in a SSDQ graph of order n. Also we derive an explicit formula for α(n) in terms of Eulers phi function.

참고문헌 (5)

  1. C. Adiga, "On strongly multiplicative graphs", South East Asian J. Math. and Math. Sci., 2, pp.45~47 (2003)
  2. C. Adiga, "A note on strongly multi- plicative graphs", Discuss. Math. Graph Theory, 24, pp.81~83 (2004)
  3. C. Adiga, "An upper bound for maximum number of edges in a strongly multiplicative graph", Discuss. Math. Graph Theory, 26, pp.225~229 (2006)
  4. L. W. Beineke, "Strongly multiplicative graphs", Discuss. Math. Graph Theory, 21, pp.63~76 (2001)
  5. R. K. Zaferani, "The maximum number edges in a strongly multiplicative graph", Bull. Iranian Math. Soc., 31(2), pp.53~56 (2005)

관련 논문AI추천

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