the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...

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...

in this paper, the degree distance and the gutman index of the corona product of two graphs are determined. using the results obtained, the exact degree distance and gutman index of certain classes of graphs are computed.

Excellent book is always being the best friend for spending little time in your office, night time, bus, and everywhere. It will be a good way to just look, open, and read the book while in that time. As known, experience and skill don't always come with the much money to acquire them. Reading this book with the PDF hierarchical voronoi graphs spatial representation and reasoning for mobile rob...

Excellent book is always being the best friend for spending little time in your office, night time, bus, and everywhere. It will be a good way to just look, open, and read the book while in that time. As known, experience and skill don't always come with the much money to acquire them. Reading this book with the PDF scale isometric polytopal graphs in hypercubes and cubic lattices polytopes in ...

The Fiduccia-Matheyses algorithm (FM) [1] is a representative iterative improvement algorithm for a hypergraph partitioning problem. But the quality of the FM is not stable. Kim and Moon [3] introduced lock gain as a primary measure for choosing the nodes to move. It uses the history of search more eÆciently. Lock gain showed excellent performance for general graphs. We adapt the lock gain for ...

In this Letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This transition is characterized by means of exact numerical simulations as well as by analytical replica calculations. The replica symmetric phase diagram is in excel...