Characterization of class III graphs for the adjacent vertex distinguishing index by sum
For a graph , let be the minimum number of colors in a proper total coloring distinguishing adjacent vertices by sums. The graph is called class III when , where is its maximum degree. Class III characterization conjecture. A graph is class III if and only if
for some . This proposes that the odd complete graphs are exactly the extremal graphs for the adjacent vertex distinguishing index by sum.
References
- Hana Choi, Dongseok Kim, Sungjin Lee and Yeonhee Lee, “A proper total coloring distinguishing adjacent vertices by sums of some product graphs”, arXiv:1402.0615 (2014).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.