On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree
Sign Up to like & getrecommendations! Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-017-1822-3
Abstract: A proper edge k-colouring of a graph $$G=(V,E)$$G=(V,E) is an assignment $$c:E\rightarrow \{1,2,\ldots ,k\}$$c:E→{1,2,…,k} of colours to the edges of the graph such that no two adjacent edges are associated with the same colour. A… read more here.
Keywords: sum; sum distinguishing; neighbour sum; edge ... See more keywords
Neighbor sum distinguishing total coloring of 2-degenerate graphs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0053-5
Abstract: A proper k-total coloring of a graph G is a mapping from $$V(G)\cup E(G)$$V(G)∪E(G) to $$\{1,2,\ldots ,k\}$${1,2,…,k} such that no two adjacent or incident elements in $$V(G)\cup E(G)$$V(G)∪E(G) receive the same color. Let f(v) denote… read more here.
Keywords: total coloring; sigma delta; sum distinguishing; distinguishing total ... See more keywords