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

Hub number of some wheel related graphs

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

A hub set in a graph G is a set S  V (G) such that any two vertices outside S are connected by a path all of whose internal vertices are members of S. The minimum cardinality of a hub set is called hub number. In this paper, we give results for the hub number of some wheel related graphs.

Abstract

A hub set in a graph G is a set S  V (G) such that any two vertices outside S are connected by a path all of whose internal vertices are members of S. The minimum cardinality of a hub set is called hub number. In this paper, we give results for the hub number of some wheel related graphs.

참고문헌 (6)

  1. J. A. Gallian, "A dynamic survey of graph labeling", Electron. J. Combin, DS6, pp.502~ (2018)
  2. T. Grauman, "The hub number of a graph", Information processing letters, 108(4), pp.226~228 (2008)
  3. F. Harary, "Graph Theory" (1969), Addison-Wesley
  4. E. C. Cuaresma Jr, "On the hub number of some graphs", Annals of studies in Science and Humanities, 1(1), pp.17~24 (2015)
  5. S. K. Vaidyaa, "b-Chromatic number of some wheel related graphs", Malaya J. Mat, 2(4), pp.482~488 (2014)
  6. M. Walsh, "The hub number of a graph", Int. J. Math. Comput. Sci, 1(1), pp.117~124 (2006)

관련 논문AI추천

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