On odd-elegant properties of generalized sun-graphs

Network structure is irregular, complex and dynamically evolving in time. Labelled graphs are used in researching areas of many networks, cryptography, computer science, biology, information etc. For simulating real networks we construct several classes of sun-like network models, and show that sun-like network models have can be strictly distinguished by odd-elegant labellings. We have several algorithms in polynomial time.