Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...

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 ...