Name
Abstract | ||
|---|---|---|
An assignment of weights to the edges and the vertices of a graph is a vertex-coloring total weighting if adjacent vertices have different total weight sums. Of interest in this paper are vertex-coloring total weightings with weight set of cardinality two, a problem motivated by the conjecture that every graph has such a weighting using the weights 1 and 2. Here we prove the existence of such weightings for certain families of graphs using any two different real weights. A related problem where all vertices have unique weight sums is also discussed. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s00373-016-1712-0 | Graphs and Combinatorics |
Keywords | Field | DocType |
Adjacent-vertex distinguishing, Total weighting, Vertex-coloring | Combinatorics,Fractional coloring,Graph homomorphism,Vertex (graph theory),Cycle graph,Neighbourhood (graph theory),Independent set,Mathematics,Graph coloring,Path graph | Journal |
Volume | Issue | ISSN |
32 | 6 | 1435-5914 |
Citations | PageRank | References |
1 | 0.37 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathan Hulgan | 1 | 1 | 0.37 |
| J. Lehel | 2 | 391 | 75.03 |
| Kenta Ozeki | 3 | 138 | 36.31 |
| Kiyoshi Yoshimoto | 4 | 133 | 22.65 |