Classification of nr-graphs

Abstract

When all possible r-gons are inscribed in an n-gon, the resulting n-graph falls into one of the following three categories: s-regular (sr or strongly regular), //-regular, or regular (k-regular). The definitions and necessary conditions to find the parameters, including the study of such graphs in terms of completeness, are developed throughout the work.