non-isomorphic regular graphs with less than 16 vertices

In this paper, we find an innovative method for non-isomorphic regular graphs with less than 16vertices. in other words, we show that we can create several distinct shapes that are still regular graphs.this simulation works in a way that the first system, although not similar in appearance, but in termsof system relations and logic, achieves the same goal of the first system, so that the r-regular graphs oforder n convert to r0-regular graphs of order of n0 that does not make a difference in the essence of thetheorem. in other words, we can turn complex geometric shapes into simple routine shapes.