Pell numbers expressed as sums or differences of two Lucas numbers: An application to graph classification

Abstract

In this letter, we provide a complete characterization of Pell numbers that can be expressed as sums or differences of two Lucas numbers, using techniques based on linear forms in logarithms and reduction methods. This characterization distinguishes polynomial families and facilitates further applications, particularly in the classification of graphs via their spectral properties.