RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      KCI등재 SCOPUS

      ON r-DYNAMIC COLORINGS OF THE FRIENDSHIP GRAPH FAMILIES

      한글로보기

      https://www.riss.kr/link?id=A108064947

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      Coloring of graphs is an important area in graph theory with numerous applications including the most famous problems related to graphs. An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min {r, d(v)}, f...

      Coloring of graphs is an important area in graph theory with numerous applications including the most famous problems related to graphs. An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min {r, d(v)}, for each vertex v ∈ V (G). The r-dynamic chromatic number of a graph G is the minimum k such that G has an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of Pn + Fn, Kn + Fn, L(Fn) and central graphs of the friendship graph.

      더보기

      참고문헌 (Reference)

      1 N.Mohanapriya, "δ- Dynamic chromatic number of double wheel graph" 11 (11): 2018

      2 A.Taherkhani, "r-Dynamic chromatic number of graphs" 201 : 222-227, 2016

      3 H. J. Lai, "Upper bounds of dynamic chromatic number" 68 : 193-201, 2003

      4 A. Dehghan, "Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number" 16 (16): 2142-2146, 2012

      5 X. Li, "The 2-nd order conditional 3-coloring of claw-free graphs" 396 : 151-157, 2008

      6 S. Akbari, "On the list dynamic coloring of graphs" 157 : 3005-3007, 2009

      7 S. Akbari, "On the dynamic chromatic number of graphs, in: Combi-natorics and Graphs" Amer. Math. Soc 531 : 11-18, 2010

      8 A. Ahadi, "On the difference between chromatic number and dynamic chromatic number of graphs" 312 : 2579-2583, 2012

      9 G.Nandini, "On r- Dynamic coloring of the family of Bistar graphs" 68 (68): 923-928, 2019

      10 G.Nandini, "On r- Dynamic coloring of Splitting graphs" (Special issue of 2nd) : 119-124, 2019

      1 N.Mohanapriya, "δ- Dynamic chromatic number of double wheel graph" 11 (11): 2018

      2 A.Taherkhani, "r-Dynamic chromatic number of graphs" 201 : 222-227, 2016

      3 H. J. Lai, "Upper bounds of dynamic chromatic number" 68 : 193-201, 2003

      4 A. Dehghan, "Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number" 16 (16): 2142-2146, 2012

      5 X. Li, "The 2-nd order conditional 3-coloring of claw-free graphs" 396 : 151-157, 2008

      6 S. Akbari, "On the list dynamic coloring of graphs" 157 : 3005-3007, 2009

      7 S. Akbari, "On the dynamic chromatic number of graphs, in: Combi-natorics and Graphs" Amer. Math. Soc 531 : 11-18, 2010

      8 A. Ahadi, "On the difference between chromatic number and dynamic chromatic number of graphs" 312 : 2579-2583, 2012

      9 G.Nandini, "On r- Dynamic coloring of the family of Bistar graphs" 68 (68): 923-928, 2019

      10 G.Nandini, "On r- Dynamic coloring of Splitting graphs" (Special issue of 2nd) : 119-124, 2019

      11 Danuta Michalak, "On Middle and Total Graphs with Coarseness number equal 1" Springer Verlag 1018 : 139-150, 1981

      12 J. Vernold Vivin, "Harmonious coloring of total graphs, n-leaf, central graphs and circumdetic graphs" Bharathiar University 2007

      13 F. Harary, "Graph Theory" Narosa Publishing home 1969

      14 B. Montgomery, "Dynamic coloring of graphs" West Virginia University 2001

      15 H.J. Lai, "Dynamic coloring of graph" Department of Mathematics, West Virginia University 2002

      16 M. Alishahi, "Dynamic chromatic number of regular graphs" 160 : 2098-2103, 2012

      17 P.Venkata Subba Reddy, "Conditional coloring of some parameterized graphs" 2010

      18 X. Li, "Complexity of conditional colorability of graphs" 22 : 320-324, 2009

      19 A. Albina, "A Study on Dominator Coloring of Friendship and Barbell Graphs" 6 (6): 99-105, 2018

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      인용정보 인용지수 설명보기

      학술지 이력

      학술지 이력
      연월일 이력구분 이력상세 등재구분
      2024 평가예정 해외DB학술지평가 신청대상 (해외등재 학술지 평가)
      2021-01-01 평가 등재학술지 선정 (해외등재 학술지 평가) KCI등재
      2020-12-01 평가 등재 탈락 (해외등재 학술지 평가)
      2013-10-01 평가 등재학술지 선정 (기타) KCI등재
      2011-01-01 평가 등재후보학술지 유지 (기타) KCI등재후보
      2008-04-08 학회명변경 한글명 : 장전수리과학회 -> 장전수학회(章田數學會) KCI등재후보
      2008-01-01 평가 SCOPUS 등재 (신규평가) KCI등재후보
      더보기

      학술지 인용정보

      학술지 인용정보
      기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
      2016 0.16 0.16 0.24
      KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
      0.29 0.27 0.609 0.15
      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼