Class 1 conjecture for relative non-commuting graphs of proper non-commutative subrings
Class 1 conjecture for relative non-commuting graphs of proper non-commutative subrings
Let be a ring and let be a proper non-commutative subring of . The relative non-commuting graph has chromatic index equal to its maximum vertex degree.
Class 1 conjecture. The relative non-commuting graph is of class .
For a graph, being of class means that its chromatic index equals its maximum vertex degree, in contrast with class , where the chromatic index is one larger. The paper establishes that the non-commuting graph of a ring is of class ; the asserted class property for proper relative non-commuting graphs is presented as a conjecture.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Jutirekha Dutta and Dhiren Kumar Basnet, “Relative non-commuting graph of a finite ring”, arXiv:1705.02161 (2017).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.