RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        Total domination number of central graphs

        Farshad Kazemnejad,Somayeh Moradi 대한수학회 2019 대한수학회보 Vol.56 No.4

        Let $G$ be a graph with no isolated vertex. \emph{A total dominating set}, abbreviated TDS of $G$ is a subset $S$ of vertices of $G$ such that every vertex of $G$ is adjacent to a vertex in $S$. \emph{The total domination number} of $G$ is the minimum cardinality of a TDS of $G$. In this paper, we study the total domination number of central graphs. Indeed, we obtain some tight bounds for the total domination number of a central graph $C(G)$ in terms of some invariants of the graph $G$. Also we characterize the total domination number of the central graph of some families of graphs such as path graphs, cycle graphs, wheel graphs, complete graphs and complete multipartite graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total domination number of central graphs.

      • SCIESCOPUSKCI등재

        TOTAL DOMINATION NUMBER OF CENTRAL GRAPHS

        Kazemnejad, Farshad,Moradi, Somayeh Korean Mathematical Society 2019 대한수학회보 Vol.56 No.4

        Let G be a graph with no isolated vertex. A total dominating set, abbreviated TDS of G is a subset S of vertices of G such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a TDS of G. In this paper, we study the total domination number of central graphs. Indeed, we obtain some tight bounds for the total domination number of a central graph C(G) in terms of some invariants of the graph G. Also we characterize the total domination number of the central graph of some families of graphs such as path graphs, cycle graphs, wheel graphs, complete graphs and complete multipartite graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total domination number of central graphs.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼