Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

DM
2007

favoriteEmaildiscussreport

55views more DM 2007»

On the number of closed walks in vertex-transitive graphs

13 years 11 months ago

On the number of closed walks in vertex-transitive graphs

Download www.imfm.si

Robert Jajcay, Aleksander Malnic, Dragan Marusic

Real-time Traffic

DM 2007 |

claim paper

Related Content

» The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs

» Closed kstop distance in graphs

» Signed analogs of bipartite graphs

» Search Algorithms for Unstructured PeertoPeer Networks

» Improved algorithms for orienteering and related problems

» Simple Permutations Mix Well

» Enabling accessprivacy for random walk based data analysis applications

» Earth Movers Morphing TopologyFree Shape Morphing Using ClusterBased EMD Flows

» Improved Algorithms for Partial Curve Matching

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	DM
Authors	Robert Jajcay, Aleksander Malnic, Dragan Marusic

Comments (0)