Ara
Toplam kayıt 5, listelenen: 1-5
On arithmetic-geometric index (GA) and edge GA index
(Işık University Press, 2018)
Let G(V (G), E(G)) be a simple connected graph and dG(u) be the degree of the vertex u. Topological indices are numerical parameters of a graph which are invariant under graph isomorphisms. Recently, people are studying ...
Force-directed approaches to sensor localization
(Assoc Computing Machinery, 2010-09)
As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity ...
Fully decentralized and collaborative multilateration primitives for uniquely localizing WSNs
(Springer International Publishing AG, 2010)
We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and ...
Some notes on spectra of cographs
(Charles Babbage Res Ctr, 2011-07)
A cograph is a P-4-free graph. We first give a short proof of the fact that 0 (-1) belongs to the spectrum of a connected cograph (with at least two vertices) if and only if it contains duplicate (resp. coduplicate) vertices. ...
Dendrimers are the unique chemical trees with maximum spectral radius
(Univ Kragujevac, 2012)
It is shown that dendrimers have maximum spectral radius and maximum Collatz-Sinogowitz index among all chemical trees of given size. The result is also generalized for the class of chemical trees with prescribed number ...