Let G = (V,E) be a graph. A set D ⊆ E is a restrained edge dominating set if every edge in E − D is adjacent to an edge in D and another edge in E − D. The restrained edge domination number of G, denoted by [수식](G), is the smallest cardinali...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A104870095
S. Ghobadi (University of Mysore) ; N. D. Soner (University of Mysore)
2009
English
KCI등재후보,SCOPUS
학술저널
143-149(7쪽)
0
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
Let G = (V,E) be a graph. A set D ⊆ E is a restrained edge dominating set if every edge in E − D is adjacent to an edge in D and another edge in E − D. The restrained edge domination number of G, denoted by [수식](G), is the smallest cardinali...
Let G = (V,E) be a graph. A set D ⊆ E is a restrained edge dominating
set if every edge in E − D is adjacent to an edge in D and another edge in
E − D. The restrained edge domination number of G, denoted by [수식](G), is the smallest cardinality of a restrained edge dominating set of G. The maximum order of a partition of E into restrained edge dominating sets of G is called the restrained edge domatic number of G and denoted by [수식](G). In this paper we determine restrained edge domination and restrained edge domatic number for certain classes of graphs and obtain some bounds for [수식] (G) and [수식](G). Finally,
we construct a special class of restrained edge domatically full graphs.
참고문헌 (Reference)
1 J.A. Telle, "Vertex Partitioning Problems: Characterization, Complexity and Algorithms on Partial k-Trees" University of Uregon
2 S. R. Jayaram, "Line Domination in Graphs" 3 : 357-363, 1987
3 D.G. Chartland, "Graphs and Digraphs, Fourth Edition" Chapman and Hall/CRC press 2004
4 F. Harary, "Graph Theory" Narosa Publishing House 2001
5 S.L. Mitchell, "Edge domination in trees" 489-509, 1977
6 B. Zelinka, "Edge domatic number of a graph" 33 : 108-, 1983
1 J.A. Telle, "Vertex Partitioning Problems: Characterization, Complexity and Algorithms on Partial k-Trees" University of Uregon
2 S. R. Jayaram, "Line Domination in Graphs" 3 : 357-363, 1987
3 D.G. Chartland, "Graphs and Digraphs, Fourth Edition" Chapman and Hall/CRC press 2004
4 F. Harary, "Graph Theory" Narosa Publishing House 2001
5 S.L. Mitchell, "Edge domination in trees" 489-509, 1977
6 B. Zelinka, "Edge domatic number of a graph" 33 : 108-, 1983
Convergence of q-Meyer-König-Zeller-Durrmeyer operators
ON STRONGLY SUM DIFFERENCE QUOTIENT GRAPHS
학술지 이력
연월일 | 이력구분 | 이력상세 | 등재구분 |
---|---|---|---|
2024 | 평가예정 | 해외DB학술지평가 신청대상 (해외등재 학술지 평가) | |
2021-01-01 | 평가 | 등재학술지 선정 (해외등재 학술지 평가) | |
2020-12-01 | 평가 | 등재 탈락 (해외등재 학술지 평가) | |
2013-10-01 | 평가 | 등재학술지 선정 (기타) | |
2011-01-01 | 평가 | 등재후보학술지 유지 (기타) | |
2008-04-08 | 학회명변경 | 한글명 : 장전수리과학회 -> 장전수학회(章田數學會) | |
2008-01-01 | 평가 | SCOPUS 등재 (신규평가) |
학술지 인용정보
기준연도 | 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 |