Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
33
search results - page 3 / 7
»
Self-complementary circulant graphs
Sort
relevance
views
votes
recent
update
View
thumb
title
13
click to vote
ISAAC
2004
Springer
92
views
Algorithms
»
more
ISAAC 2004
»
Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs
14 years 21 days ago
Download
www.cse.ust.hk
Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang
claim paper
Read More »
18
click to vote
CMA
2010
73
views
more
CMA 2010
»
On the chromatic number of integral circulant graphs
13 years 4 months ago
Download
www.dms.org.rs
Aleksandar Ilic, Milan Basic
claim paper
Read More »
23
click to vote
CMA
2011
173
views
Distributed And Parallel Com...
»
more
CMA 2011
»
Further results on the perfect state transfer in integral circulant graphs
12 years 11 months ago
Download
tesla.pmf.ni.ac.rs
Marko D. Petkovic, Milan Basic
claim paper
Read More »
15
click to vote
PDCAT
2007
Springer
102
views
Distributed And Parallel Com...
»
more
PDCAT 2007
»
Optimal Routing in Binomial Graph Networks
14 years 1 months ago
Download
vgrads.rice.edu
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
Thara Angskun, George Bosilca, Bradley T. Vander Z...
claim paper
Read More »
14
click to vote
DM
2006
85
views
more
DM 2006
»
Further analysis of the number of spanning trees in circulant graphs
13 years 7 months ago
Download
math.uprm.edu
Let 1 s1 < s2 <
Talip Atajan, Xuerong Yong, Hiroshi Inaba
claim paper
Read More »
« Prev
« First
page 3 / 7
Last »
Next »