A Note on Edge-Domsaturation Number of a Graph

• 作者: Devadhas Nidha Murugan Kala
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: Edge-Dominating Set Edge-Domination NUMBER ds'- Critical Edge-Domsaturation NUMBER WELL EDGE Dominated GRAPH
• 年，卷（期）: 2012,（3）
• 页码范围: 109-113
• 页数: 5页
• 分类号: O1

摘要

The edge-domsaturation number ds'(G) of a graph G = (V, E) is the least positive integer k such that every edge of G lies in an edge dominating set of cardinality k. In this paper, we characterize unicyclic graphs G with ds'(G) = q – Δ'(G) + 1 and investigate well-edge dominated graphs. We further define γ'–-critical, γ'+-critical, ds'–-critical, ds'+-critical edges and study some of their properties.