Localization in WSN involves the global discovery of node coordinates. In a network topology, a few nodes are deployed to known nodal locations and remaining node nodal location information are dynamically estimated using with algorithms. The nodes of sensor network are of random type and the topology of network varied dynamically, as a result the most of the localization techniques fails in lo...

The problem of detecting the given subsystems in complex circuits is now an important problem in the computer aided design of VLSI. The algorithm for solving the problem of detecting recurring subsystems is presented in this paper. The algorithm is structure independent, namely any circuit which can be described as a digraph can be handled by this algorithm. The computational complexity is redu...

There has been a great deal of recent work within the knowledge systems community concerning the role that graph and network theory can play in the organization and retrieval of information. The basic idea is that knowledge systems, including document corpora, but most especially the World Wide Web, can be amply represented as a network or graph-theoretical structure. Then, mathematical and sta...

Abstract—The world wide web network is a network with a complex topology, the main properties of which are the distribution of degrees in power law, A low clustering coefficient and a weak average distance. Modeling the web as a graph allows locating the information in little time and consequently offering a help in the construction of the research engine. Here, we present a model based on the ...

In this work, an attempt has been made to represent and simulate fingerprint pattern analysis mathematically using graph isomorphism, dominance pebbling. The idea of categorizing by locating the ridge characteristics attempted be implemented in work. An image is used as input for mathematical modelling simulation. For simulation a fingerprint, we define two techniques. first technique, Algorith...

a multicone graph is defined to be join of a clique and a regular graph. a graph $ g $ is  cospectral with  graph $ h $ if their adjacency matrices have the same eigenvalues. a graph $ g $ is  said to be  determined by its spectrum or ds for short, if for any graph $ h $ with $ spec(g)=spec(h)$, we conclude that $ g $ is isomorphic to $ h $. in this paper, we present new classes of  multicone g...

The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...