We consider simple connected graphs for which there is a path of length at least k between every pair of distinct vertices. We wish to show that in these graphs the cycle space over $\mathbb{Z}_2$ is generated by the cycles of length at least $mk$, where $m = 1$ for $3 \le k \le 6$, $m = 6/7$ for $k = 7$, $m \ge 1/2$ for $k \ge 8$ and $m \le 3/4 + 0(1)$ for large k.
k-path connectivity and mk-generation, an upper bound
ABREU, Marien;
2006-01-01
Abstract
We consider simple connected graphs for which there is a path of length at least k between every pair of distinct vertices. We wish to show that in these graphs the cycle space over $\mathbb{Z}_2$ is generated by the cycles of length at least $mk$, where $m = 1$ for $3 \le k \le 6$, $m = 6/7$ for $k = 7$, $m \ge 1/2$ for $k \ge 8$ and $m \le 3/4 + 0(1)$ for large k.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
