Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

A Note on the Total Detection Numbers of Cycles

Henry E. EscuadroFutaba FujieChad E. Musick — 2015

Discussiones Mathematicae Graph Theory

Let G be a connected graph of size at least 2 and c :E(G)→{0, 1, . . . , k− 1} an edge coloring (or labeling) of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G, the color code of v with respect to c is the k-vector code(v) = (a0, a1, . . . , ak−1), where ai is the number of edges incident with v that are labeled i for 0 ≤ i ≤ k − 1. The labeling c is called a detectable labeling if distinct vertices in G have distinct color codes. The value val(c) of...

Page 1

Download Results (CSV)