Restrained edge domination number in graphs
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
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 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.
참고문헌 (6)
- D.G. Chartland, "Graphs and Digraphs, Fourth Edition", pp.2004, Chapman and Hall
- F. Harary, "Graph Theory" (2001), Narosa Publishing House
- S. R. Jayaram, "Line Domination in Graphs", Graphs and Combinatorics, 3, pp.357~363 (1987)
- S.L. Mitchell, "Edge domination in trees", 8th Southeast Conference in Graph Theory, Combinatorics and Computing, Utilitas Mathematica, pp.489~509 (1977)
- J.A. Telle, "Vertex Partitioning Problems: Characterization, Complexity and Algorithms on Partial k-Trees", 박사
- B. Zelinka, "Edge domatic number of a graph", Czech. Math. J., 33, pp.108~ (1983)