15 search results - page 1 / 3 » On the number of closed walks in vertex-transitive graphs |
DM
2007
13 years 4 months ago
2007
CAI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
DMGT
2011
12 years 8 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
DM
1998
13 years 4 months ago
1998
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
LCN
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...