개인구독
소속 기관이 없으신 경우, 개인 정기구독을 하시면 저렴하게
논문을 무제한 열람 이용할 수 있어요.
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
Complexity Issues of Perfect Roman Domination in Graphs
Complexity Issues of Perfect Roman Domination in Graphs
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 경북대학교 자연과학대학 수학과 Kyungpook Mathematical Journal Kyungpook Mathematical Journal 제61권 제3호 KCI Accredited Journals
- 발행연도
- 2021.9
- 수록면
- 661 - 669 (9page)
이용수
Complexity Issues of Perfect Roman Domination in Graphs
초록· 키워드
오류제보하기
Given a graph G and a positive integer k, the PRDF problem is to check whether G has a perfect Roman dominating function of weight at most k. In this paper, we first investigate the complexity of PRDF problem for some subclasses of bipartite graphs namely, star convex bipartite graphs and comb convex bi-partite graphs. Then we show that PRDF problem is linear time solvable for bounded tree-width graphs, chain graphs and threshold graphs, a subclass of split graphs.
목차
등록된 정보가 없습니다.
참고문헌 (15)
참고문헌 신청
B. Courcelle / 1990 / The monadic second-order logic of graphs. I. Recognizable sets of finite graphs / Inf. Comput 85:12~75
C. E. Leiserson / 2001 / Introduction to algorithms / MIT press
D. B. West / 2001 / Introduction to Graph Theory / Prentice hall
E. J. Cockayne / 2004 / Roman domination in graphs / Discrete Math 278:11~22
M. Yannakakis / 1978 / Node-and edge-deletion np-complete problems / Proceedings of the Tenth Annual ACM Symposium on Theo. of Comp :253~264
C. E. Leiserson / 2001 / Introduction to algorithms / MIT press
D. B. West / 2001 / Introduction to Graph Theory / Prentice hall
E. J. Cockayne / 2004 / Roman domination in graphs / Discrete Math 278:11~22
M. Yannakakis / 1978 / Node-and edge-deletion np-complete problems / Proceedings of the Tenth Annual ACM Symposium on Theo. of Comp :253~264
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Total domination number of central graphs
대한수학회보
2019 .01
-
Graph Equations Involving Tensor Product of Graphs
Kyungpook Mathematical Journal
2017 .06
-
Induced signed graphs of some classes of graphs
Proceedings of the Jangjeon Mathematical Society
2020 .01
-
METRIC DIMENSION AND ITS VARIATIONS OF CHAIN GRAPHS
Proceedings of the Jangjeon Mathematical Society
2021 .07
-
Some Properties of q-Distance Energy
Advanced Studies in Contemporary Mathematics
2020 .01
-
ON HARMONIOUS COLORINGS OF LEXICOGRAPHIC PRODUCT OF GRAPHS
Advanced Studies in Contemporary Mathematics
2021 .04
-
On co-well covered graphs
대한수학회논문집
2020 .01
-
Spectra of F-sum graphs and F-product graphs
Proceedings of the Jangjeon Mathematical Society
2018 .01
-
New results on the F-index of graphs based on Corona-type products of graphs
Proceedings of the Jangjeon Mathematical Society
2020 .01
-
On −domination Zagreb indices of graphs and some graph operations
Proceedings of the Jangjeon Mathematical Society
2023 .04
-
CHARACTERISTIC POLYNOMIALS OF SUBDIVISION GRAPHS
Advanced Studies in Contemporary Mathematics
2021 .01
-
On the annihilator graph of group rings
대한수학회보
2017 .01
-
On rings whose annihilating-ideal graphs are blow-ups of a class of Boolean graphs
대한수학회지
2017 .01
-
Right-angled Artin groups on path graphs, cycle graphs and complete bipartite graphs
한국수학논문집
2021 .09
-
Domination parameters in Mycielski graphs
대한수학회보
2021 .01
-
SIGNED A-POLYNOMIALS OF GRAPHS AND POINCAR´E POLYNOMIALS OF REAL TORIC MANIFOLDS
대한수학회보
2015 .01
-
Fibonacci Graph and its Energies
Advanced Studies in Contemporary Mathematics
2021 .01
-
ON r-DYNAMIC COLORINGS OF THE FRIENDSHIP GRAPH FAMILIES
Advanced Studies in Contemporary Mathematics
2021 .04
-
THE MINIMUM MULTIPLICITY OF STAR GRAPHS
Advanced Studies in Contemporary Mathematics
2017 .01
-
The Wiener Polynomial for the Subdivision Graph of Certain Classes of Graphs
Advanced Studies in Contemporary Mathematics
2015 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0