The Proper Diameter of a Graph

Abstract

A proper edge-coloring of a graph is a coloring in which adjacent edges receive distinct colors. A path is properly colored if consecutive edges have distinct colors, and an edge-colored graph is properly connected if there exists a properly colored path between every pair of vertices. In such a graph, we introduce the notion of the graph’s proper diameter—which is a function of both the graph and the coloring—and define it to be the maximum length of a shortest properly colored path between any two vertices in the graph. We consider various families of graphs to find bounds on the gap between the diameter and possible proper diameters, paying singular attention to 2-colorings.

Keywords

• diameter
• properly connected
• proper diameter
• 05c12
• 05c15