This is a preview. Log in through your library . Abstract Let G be a graph and let S = (s₁, s₂,...,sk) be a non-decreasing sequence of positive integers. An S-packing coloring of G is a mapping c : ...
Power graphs provide an innovative way to visualise and analyse the algebraic structure of finite groups. In a power graph, the elements of a finite group serve as vertices, and an edge is drawn ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback