Name
Abstract | ||
|---|---|---|
For a nonempty graph G = ( V , E ), a signed edge-domination of G is a function $${f: E(G) \to \{1,-1\}}$$ such that $${\sum_{e'\in N_{G}[e]}{f(e')} \geq 1}$$ for each $${e \in E(G)}$$ . The signed edge-domatic number of G is the largest integer d for which there is a set { f 1, f 2, . . . , f d } of signed edge-dominations of G such that $${\sum_{i=1}^{d}{f_i(e)} \leq 1}$$ for every $${e \in E(G)}$$ . This paper gives an original study on this concept and determines exact values for some special classes of graphs, such as paths, cycles, stars, fans, grids, and complete graphs with even order. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s00373-012-1234-3 | Graphs and Combinatorics |
Keywords | Field | DocType |
hadamard matrix,domatic number,domination,signed edge-domination,signed edge-domatic number | Integer,Graph,Discrete mathematics,Combinatorics,Hadamard matrix,Mathematics,Domatic number | Journal |
Volume | Issue | ISSN |
29 | 6 | 1435-5914 |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiang-Jun Li | 1 | 51 | 4.37 |
| Jun-ming Xu | 2 | 671 | 53.22 |