Restrained Italian domination in trees
- 문서 유형
- 연구출판물 · 학술지 논문
- 등재
- ESCIScopus
- 저널 순위
- Scopus Q4
- 저널
- INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY6(3) · pp.236 · 2021
- 피인용
- Scopus 2
- FWCI (Scopus)
- 0.1
- ISSN
- 2379-9927
저자
- 김기정제1저자교신저자Department of Mathematics, Pusan National University, Busan, Republic of Korea
초록
© 2021 Informa UK Limited, trading as Taylor & Francis Group.Let (Formula presented.) be a graph. A subset D of V is a restrained dominating set if every vertex in (Formula presented.) is adjacent to a vertex in D and to a vertex in (Formula presented.). The restrained domination number, denoted by (Formula presented.), is the smallest cardinality of a restrained dominating set of G. A function (Formula presented.) is a restrained Italian dominating function on G if (i) for each vertex (Formula presented.) for which (Formula presented.), it holds that (Formula presented.), (ii) the subgraph induced by (Formula presented.) has no isolated vertices. The restrained Italian domination number, denoted by (Formula presented.), is the minimum weight taken over all restrained Italian dominating functions of G. It is known that (Formula presented.) for any graph G. In this paper, we characterize the trees T for which (Formula presented.), and we also characterize the trees T for which (Formula presented.).
키워드
식별자
- Scopus EID
- 2-s2.0-85114801880



로그인
연구물 목록으로