Results 101 to 110 of about 410 (178)

On magic and supermagic circulant graphs

open access: yesDiscrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On planarity and colorability of circulant graphs

open access: yesDiscrete Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Some new optimal and suboptimal infinite families of undirected double-loop networks

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
Let n, s be positive integers such that 2≤s<n and s≠ n / 2. An undirected double-loop network G(n; 1, s) is an undirected graph (V, E), where V = ℤ n = {0, 1, 2, …, n-1 } and E = { (i, i+1 mod n), (i, i+s mod n)  |  i ∈ℤ}.
Bao Xing Chen   +2 more
doaj  

Home - About - Disclaimer - Privacy