2024/01/19 by Stevanović, Dragan, Ghebleh, Mohammad, Caporossi, Gilles +2
#05C07 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2401.10971
The triangle-degree of a vertex v of a simple graph G is the number of triangles in G that contain v. A simple graph is triangle-distinct if all its vertices have distinct triangle-degrees. Berikkyzy et al. [Discrete Math. 347 (2024) 113695] recently asked whether there exists a regular graph that is triangle-distinct. Here we showcase the examples of regular, triangle-distinct graphs with orders between 21 and 27, and report on the methodology used to find them.