On Mon, 29 Jun 2020, 18:59 Dima Pasechnik, wrote:
> On Mon, Jun 29, 2020 at 6:25 PM David Joyner wrote:
> >
> > Hi:
> >
> > In SageMath version 9.1.beta3, I get
> >
> > sage: Gamma1 = graphs.CirculantGraph(10,[2,4])
> >
> > sage: Gamma1.is_connected()
> >
> > False
> >
> >
> > My understanding
On Mon, Jun 29, 2020 at 2:04 PM John H Palmieri
wrote:
> According to wikipedia, graphs.CirculantGraph(n, [j_1, j_2, ...]) is
> connected if and only if gcd(n, j_1, j_2, ...) = 1. In this case, the gcd
> is 2. If Sage's definition is correct, it's defined as having 10 vertices,
> and vertex i is
Hello,
is there a chance to get grindlines not ever 1 unit but in 0.5 untis?
Thanks a lot
Bert
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
According to wikipedia, graphs.CirculantGraph(n, [j_1, j_2, ...]) is
connected if and only if gcd(n, j_1, j_2, ...) = 1. In this case, the gcd
is 2. If Sage's definition is correct, it's defined as having 10 vertices,
and vertex i is connected to vertices i+2, i-2, i+4, i-4, then even
vertices
On Mon, Jun 29, 2020 at 6:25 PM David Joyner wrote:
>
> Hi:
>
> In SageMath version 9.1.beta3, I get
>
> sage: Gamma1 = graphs.CirculantGraph(10,[2,4])
>
> sage: Gamma1.is_connected()
>
> False
>
>
> My understanding is that all circulant graphs are connected.
no, why? e.g.
Hi:
In SageMath version 9.1.beta3, I get
sage: Gamma1 = graphs.CirculantGraph(*10*,[*2*,*4*])
sage: Gamma1.is_connected()
False
My understanding is that all circulant graphs are connected.
Is this a bug?
- David
--
You received this message because you are subscribed to the Google Groups
