Sciweavers

33 search results - page 3 / 7

» Self-complementary circulant graphs

59

ISAAC
2004
Springer

92views Algorithms» more ISAAC 2004»

Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs

15 years 5 months ago

Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs

Download www.cse.ust.hk

Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang

claim paper

Read More »

52

CMA
2010

73views more CMA 2010»

On the chromatic number of integral circulant graphs

14 years 9 months ago

On the chromatic number of integral circulant graphs

Download www.dms.org.rs

Aleksandar Ilic, Milan Basic

claim paper

Read More »

89

CMA
2011

173views Distributed And Parallel Com...» more CMA 2011»

Further results on the perfect state transfer in integral circulant graphs

14 years 3 months ago

Further results on the perfect state transfer in integral circulant graphs

Download tesla.pmf.ni.ac.rs

Marko D. Petkovic, Milan Basic

claim paper

Read More »

80

PDCAT
2007
Springer

102views Distributed And Parallel Com...» more PDCAT 2007»

Optimal Routing in Binomial Graph Networks

15 years 5 months ago

Optimal Routing in Binomial Graph Networks

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 »

72

DM
2006

85views more DM 2006»

Further analysis of the number of spanning trees in circulant graphs

14 years 11 months ago

Further analysis of the number of spanning trees in circulant graphs

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 »