Name
Abstract | ||
|---|---|---|
The closed neighbourhood N-G[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end vertex with e. Let integral be a function on the edges of G into the set {- 1, 1}. If Sigma(e is an element of NG[x]) f(e) >= 1 for every x is an element of E(G), then f is called a signed edge domination function of G. The minimum value of Sigma(x is an element of E(G)) f(x), taken over every signed edge domination function f of G, is called signed edge domination number of G and denoted by gamma '(s) (G). It has been proved that. gamma'(s) (G) >= n - m for every graph G of order n and size m. In this paper we prove that. gamma '(s) (G) >= 2 alpha '(G)-m/3 for every simple graph G, where alpha '(G) is the size of a maximum matching of G. We also prove that for a simple graph G of order n whose each vertex has an odd degree, gamma '(s)(G) <= n - 2 alpha '(G)/3 . |
Year | Venue | DocType |
|---|---|---|
2014 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
58 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saieed Akbari | 1 | 140 | 35.56 |
| Hossein Esfandiari | 2 | 88 | 15.38 |
| E. Barzegary | 3 | 0 | 0.34 |
| Saeed Seddighin | 4 | 35 | 12.24 |