Abstract

The distance between two edges in a simple connected graph can be described as the distance between the corresponding vertices in its line graph. In this paper, we determine the distance between edges in strong double graphs and apply our results to compute some edge distance-related invariants for this family of graphs.

Keywords: Distance between edges in graph; graph invariants; strong double graphs.

MSC: 05C12, 05C76

DOI: 10.57016/MV-EhnQ1530

Pages:  1--14