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

The hull number of powers of cycles

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

Let $C_n$ be the cycle graph of order $n$ on the vertices $\upsilon_0$, $\upsilon_1,\ldots$, $\upsilon_n$ and $C_n^k$ be the $k$-th power of $C_n$. In this article we determine the hull-number of $C_n^k$.

Abstract

Let $C_n$ be the cycle graph of order $n$ on the vertices $\upsilon_0$, $\upsilon_1,\ldots$, $\upsilon_n$ and $C_n^k$ be the $k$-th power of $C_n$. In this article we determine the hull-number of $C_n^k$.

참고문헌 (10)

  1. O. AbuGhneim, "The geodetic, hull, and Steiner numbers of powers of paths", Util. Math, 95, pp.289~294 (2014)
  2. J. Bermond, "Distributed loop computer networks: a survey", J. Parallel Distributed Computing, 24, pp.2~10 (1995)
  3. J. Cáceresa, "On the geodetic and the hull numbers in strong product graphs", Comput. Math. Appl, 60(11), pp.3002~3031 (2010)
  4. S. R. Canoy, "Convexity, geodetic and hull numbers of the join of graphs", Utilitas Math, 71, pp.143~159 (2006)
  5. G. Chartrand, "Convexity in oriented graphs", Discrete Appl. Math, 116, pp.115~126 (2002)
  6. G. Chartrand, "The hull number of an oriented graph", International J. Math. Math. Sci, 36, pp.2265~2275 (2003)
  7. M. C. Dourado, "On the computation of the hull number of a graph", Discrete Math, (18), pp.5668~5674 (2009)
  8. M. G. Everett, "The hull number of a graph", Discrete Math, 57(3), pp.217~223 (1985)
  9. M. Farber, "Convexity in graphs and hypergraphs", SIAM J. Algebraic Discrete Methods, 7(3), pp.433~444 (1986)
  10. D. E. Knuth, "The Art of Computer Programming. Vol. 3" (1975), Addison-Wesley

관련 논문AI추천

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