Name
Abstract | ||
|---|---|---|
A [k]-total-weighting ω of a simple graph G is a mapping ω:V(G)∪E(G)→{1,…,k}. A [k]-total-weighting ω of G is neighbour-distinguishing if, for each pair of adjacent vertices u,v∈V(G), the value ω(u)+∑uw∈E(G)ω(uw) is distinct from ω(v)+∑vw∈E(G)ω(vw). The 1,2-Conjecture states that every simple graph G has a neighbour-distinguishing [2]-total-weighting. In this work, we prove that the 1,2-Conjecture is valid for all powers of cycles. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.endm.2015.07.015 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
total-weighting,neighbour-distinguishing,1,2-Conjecture,powers of cycles | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Conjecture,Mathematics | Journal |
Volume | ISSN | Citations |
50 | 1571-0653 | 1 |
PageRank | References | Authors |
0.36 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Atílio G. Luiz | 1 | 3 | 1.45 |
| C.N. Campos | 2 | 46 | 6.43 |
| Simone Dantas | 3 | 119 | 24.99 |
| D. Sasaki | 4 | 7 | 3.94 |