#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2001

2018

- This year (2)
- Last 5 years (7)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Walter Klotz, Torsten Sander
- Electr. J. Comb.
- 2007

The unitary Cayley graph Xn has vertex set Zn = {0, 1, . . . , n−1}. Vertices a, b are adjacent, if gcd(a− b, n) = 1. For Xn the chromatic number, the clique number, the independence number, the… (More)

- Colin Atkinson, Barbara Paech, Jens Reinhold, Torsten Sander
- EDOC
- 2001

Component-based software engineering is widely expected to revolutionize the way in which software systems are developed and maintained. However, companies who wish to adopt the component paradigm… (More)

- Walter Klotz, Torsten Sander
- Electr. J. Comb.
- 2010

Let Γ be a finite, additive group, S ⊆ Γ, 0 6∈ S, − S = {−s : s ∈ S} = S. The undirected Cayley graph Cay(Γ, S) has vertex set Γ and edge set {{a, b} : a, b ∈ Γ, a − b ∈ S}. A graph is called… (More)

- Torsten Sander
- Electr. J. Comb.
- 2008

For every cograph there exist bases of the eigenspaces for the eigenvalues 0 and −1 that consist only of vectors with entries from {0, 1,−1}, a property also exhibited by other graph classes.… (More)

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by… (More)

- Walter Klotz, Torsten Sander
- Ars Math. Contemp.
- 2016

It is shown that the chromatic number χ(G) = k of a uniquely colorable Cayley graph G over a group Γ is a divisor of |Γ| = n. Each color class in a k-coloring of G is a coset of a subgroup of order… (More)

- Walter Klotz, Torsten Sander
- Electr. J. Comb.
- 2011

An undirected graph is called integral, if all of its eigenvalues are integers. Let Γ = Zm1 ⊗· · ·⊗Zmr be an abelian group represented as the direct product of cyclic groups Zmi of order mi such that… (More)

In this work a composition-decomposition technique is presented that correlates tree eigenvectors with certain eigenvectors of an associated so-called skeleton forest. In particular, the matching… (More)