Graphs with vertex-coloring and detectable 2-edge-weighting
For a connected graph G of order |V(G)|≥3 and a k-edge-weighting c:E(G)→{1,2,…,k} of the edges of G, the code, codec(v), of a vertex v of G is the ordered k-tuple (ℓ1,ℓ2,…,ℓk), where ℓi is the number of edges incident with v that are weighted i. (i) The k-edge-weighting c is detectable if every two...
| Autors principals: | , |
|---|---|
| Format: | Article |
| Idioma: | English |
| Publicat: |
Taylor & Francis Group
2016-08-01
|
| Col·lecció: | AKCE International Journal of Graphs and Combinatorics |
| Matèries: | |
| Accés en línia: | http://www.sciencedirect.com/science/article/pii/S0972860016300913 |