Edge-Colored Graph Theory is a vibrant area within combinatorics that extends the classical study of graphs by assigning colours to edges. This paradigm not only uncovers subtle structural properties ...

This note proposes a new edge elimination criterion in an algorithm whose purpose is to locate the center of a graph. The new criterion requires the same amount of information and computation but ...