Graphs and Closed Surfaces Associated with a Pairing of Edges for Regular Polygons

In this paper, we define the concept of graph extension, embedded on a closed and orientable surface, associated to a pairing of edges of regular polygons in order to show that the K-regular pairing of edges graphs can be obtained by the canonical extension of graphs (graphs with a single vertex). We will present examples of K-regular graphs associated to surfaces with genus g≤3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$g\le 3$$\end{document}.