Labelling Sun-Like Graphs from Scale-Free Small-World Network Models

Abstract

General sun-graphs are applied to an actual ring network. Each node in the network represents a server, which is equivalent to that the graph is connected by nodes represented as servers. One can use labellings to distinguish nodes and edges between nodes in order to find some fast algorithms to imitate some effective transmissions and communications in information networks. We propose method for constructing scale-free small-world network models, also, building sun-like network models, motivated from some ring real-networks, and show that sun-like network models have can be strictly distinguished by felicitous labellings.