The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Finding quantitative measures for describing and characterizing the structural properties of networks is a research topic with ongoing interest. These measures are called graph invariants and are usually referred to as topological indices. The oldest topological index is the Wiener index, it has been extensively studied in many applications such as chemical graph theory, complex network, social networks,...
Network is the engineering discipline concerned with the communication between computer systems or devices. A computer network is any set of computers or devices connected to each other with the ability to exchange data. Computers on a network are sometimes called nodes. Networks can be broadly classified as using graphs. In the most common sense of the term, a graph is an ordered pair G = (V, E)...
This paper aims to investigate the internally disjoint paths in Q{n,2}. For this purpose, the structural natures of Q{n, k} (1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Q{n,k}. Based on the results, it has been found that for any two distinct vertices x and y there exists n+1 internally disjoint paths connecting x and y, which traverses all...
Many research on the WK-recursive network has been published during the past several years due to its favorite properties. In this paper, we consider the fault-tolerant hamiltonian connectivity of the WK-recursive network. We use K(d, t) to denote the WK-recursive network of level t, each of which basic modules is a d-vertex complete graph. The fault-tolerant hamiltonian connectivity is defined to...
The attack graph, a typical model-based method, is widely used in the field of network security evaluation. The biggest disadvantage of attack graph method is its exponential growth of the state space. This paper presents an efficient algorithm based on the malefactorpsilas access level vector in every host of the network to generate a reduced attack graph in polynomial compute complexity. In this...
In this paper, it has been shown that computational jobs, such as encoding of input data and AND, OR operation, can work on the computers (by using computer databases and algorithms for the purpose of speeding up and enhancing biological research). By combining more complex functions, more complex molecular programs for gene analysis can be constructed. It is expected an in vivo (i.e. inside cellular...
Many complex networks exhibit a scale-free, power-law distribution of vertex degrees. This common feature is a consequence of two generic mechanisms relating to the formation of real networks: (i) Networks tend to expand over time through the addition of new vertices, and (ii) New vertices attach preferentially to those that are already well connected. We show that for many natural or man-made complex...
We present a novel framework, called balanced overlay networks (BON), that provides scalable, decentralized load balancing for distributed computing using large-scale pools of heterogeneous computers. Fundamentally, BON encodes the information about each node's available computational resources in the structure of the links connecting the nodes in the network. This distributed encoding is self-organized,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.