Total weight choosability of Mycielski graphs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-015-9943-1
Abstract: A total weighting of a graph G is a mapping $$\phi $$ϕ that assigns a weight to each vertex and each edge of G. The vertex-sum of $$v \in V(G)$$v∈V(G) with respect to $$\phi $$ϕ… read more here.
Keywords: mycielski graph; total weighting; graph; phi ... See more keywords