We focus on constructing the domi-join model by doing the join operation based on two smallest dominating sets of two network models and analysis the properties of domi-join model, such as power law distribution, small world. Besides, we will import two class of edge-bound growing network models to explain the process of domi-join model. Then we compute the average degree, clustering coefficien...

The clustering coefficient C of a network, which is a measure of direct connectivity between neighbors of the various nodes, ranges from 0 (for no connectivity) to 1 (for full connectivity). We define extended clustering coefficients C(h) of a small-world network based on nodes that are at distance h from a source node, thus generalizing distance-1 neighborhoods employed in computing the ordina...

We investigate the Watts-Strogatz network with the clustering coefficient C dependent on the rewiring probability. The network is an area of two opposite contact processes, where nodes can be in two states, S or D. One of the processes is governed by the Sznajd dynamics: if there are two connected nodes in D-state all their neighbors become D with probability p. For the opposite process it is s...

Clustering coefficient-a measure derived from the new science of networks-refers to the proportion of phonological neighbors of a target word that are also neighbors of each other. Consider the words bat, hat, and can, all of which are neighbors of the word cat; the words bat and hat are also neighbors of each other. In a perceptual identification task, words with a low clustering coefficient (...

The current work presents a study concerning similarity networks for a well defined and used dataset of proteins, constructed using sequence and structural derived similarity criteria. The analysis is made on the initial set of proteins and the subsets of proteins that yield to fully connected networks using both similarity criteria. Several parameters describing the networks are reported, wher...

We study the dependence of the largest component in regular networks on the clustering coefficient, showing that its size changes smoothly without undergoing a phase transition. We explain this behavior via an analytical approach based on the network structure, and provide an exact equation describing the numerical results. Our work indicates that intrinsic structural properties always allow th...

The clustering coefficient quantifies how well connected are the neighbors of a vertex in a graph. In real networks it decreases with the vertex degree, which has been taken as a signature of the network hierarchical structure. Here we show that this signature of hierarchical structure is a consequence of degree-correlation biases in the clustering coefficient definition. We introduce a definit...

We investigate the geometric properties of the communication graph in realistic low-power wireless networks. In particular, we explore the concept of the curvature of a wireless network via the clustering coefficient. Clustering coefficient analysis is a computationally simplified, semilocal approach, which nevertheless captures such a large-scale feature as congestion in the underlying network...

Predicting missing links in incomplete complex networks efficiently and accurately is still a challenging problem. The recently proposed CAR (Cannistrai-Alanis-Ravai) index shows the power of local link/triangle information in improving link-prediction accuracy. With the information of level-2 links, which are links between common-neighbors, most classical similarity indices can be improved. Ne...

One of the most prominent properties in real-world networks is the presence of a community structure, i.e. dense and loosely interconnected groups of nodes called communities. In an attempt to better understand this concept, we study the relationship between the strength of the community structure and the network transitivity (or clustering coefficient). Although intuitively appealing, this ana...