Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring ZJoanna Skowronek-KaziówInf. Process. Lett.2008
Graphs with multiplicative vertex-coloring 2-edge-weightingsJoanna Skowronek-KaziówJ. Comb. Optim.2017A k-weighting w of a graph is an assignment of an integer weight w(e) ∈ {1, ...k} to each edge e. Such an edge weighting induces a vertex coloring c defined by c(v) = ∏ v∈e w(e). A k-weighting of a… (More)