Sciweavers

3 search results - page 1 / 1
» Products of Circulant Graphs Are Metacirculant
Sort
View
50
Voted
JCT
2002
58views more  JCT 2002»
14 years 9 months ago
Products of Circulant Graphs Are Metacirculant
Robin S. Sanders
WG
2004
Springer
15 years 2 months ago
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
Mordecai J. Golin, Yiu-Cho Leung
IPPS
2009
IEEE
15 years 4 months ago
Toward adjoinable MPI
4 Automatic differentiation is the primary means of obtaining analytic5 derivatives from a numerical model given as a computer program. There-6 fore, it is an essential productivi...
Jean Utke, Laurent Hascoët, Patrick Heimbach,...