Two classes of edge domination in graphs

Authors:
Baogen Xu
Affiliations:
Department of Mathematics, East China Jiaotong University, Nanchang, PR China
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 4
Cited 4

A note on the lower bounds of signed domination number of a graph

Discrete Mathematics
Extremal graphs for inequalities involving domination parameters

Discrete Mathematics
On signed edge domination numbers of graphs

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications

Note: A note on the signed edge domination number in graphs

Discrete Applied Mathematics
Note: Signed star k-subdomination numbers in graphs

Discrete Applied Mathematics
Note: A comment to: Two classes of edge domination in graphs

Discrete Applied Mathematics
Note: Signed star domatic number of a graph

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

Let γ's(G) (γ'l(G), resp.) be the number of (local) signed edge domination of a graph G [B. Xu, On signed edge domination numbers of graphs, Discrete Math. 239 (2001) 179-189]. In this paper, we prove mainly that γ's(G) ≤ ⌊11/6n - 1⌋ and γ's(G) ≤ 2n - 4 hold for any graph G of order n (n ≥ 4), and pose several open problems and conjectures.