Professional Documents
Culture Documents
Ngo
Math
469
5.
In
a
graph
of
order
𝑛 ≥ 2,
there
are
𝑛
possible
degrees
for
any
given
vertex:
0, 1, … , 𝑛 − 1.
Vertices
of
degree
𝑛 − 1
and
degree
zero
cannot
coexist
in
a
graph,
as
a
vertex
of
degree
𝑛 − 1
must
be
joined
to
all
other
vertices,
and
vertices
with
degree
zero
cannot
be
joined
to
any
other
vertices.
As
a
result,
in
a
graph
of
order
𝑛 ≥ 2,
there
may
only
exist
a
maximum
of
𝑛 − 1
distinct
degree
values.
Because
there
are
𝑛
vertices
in
a
graph
of
order
𝑛,
but
there
are
a
maximum
of
𝑛 − 1
distinct
degree
values
possible
in
such
a
graph,
there
must
exist
at
least
two
vertices
of
the
same
degree.
The
same
conclusion
does
not
hold
true
for
general
graphs.
12.
The
first
two
graphs
are
isomorphic.
The
third
is
not
isomorphic
to
either
of
the
second
two.
There
exists
a
cycle
of
length
6
in
both
of
the
first
two
graphs,
but
there
is
no
such
cycle
in
the
third.
Graphs
one
and
two
can
be
connected
by
the
isomorphism
𝑓 𝑥 = 𝑥′
when
the
graphs
are
labeled
as
such.
13.
Prove
that,
if
two
vertices
of
a
general
graph
are
joined
by
a
walk,
then
they
are
joined
by
a
path.
Let
x
and
y
be
arbitrary
vertices
of
a
general
graph.
Assume
that
x
and
y
are
connected
by
a
walk
containing
the
vertices
a1,
a2,
…,
an.
If
some
vertex
𝑎!
is
repeated
in
the
walk,
there
exists
a
shorter
walk
that
still
connects
x
and
y.
This
walk
can
be
created
by
joining
the
walk
from
x
to
the
first
occurrence
of
𝑎!
the
walk
that
connects
those
vertices
that
occur
after
the
last
occurrence
of
𝑎! .
So,
our
walk
𝑥 − ⋯ − 𝑎! − ⋯ − 𝑎! − ⋯ − 𝑦
has
been
shortened
to
the
walk
𝑥 − ⋯ − 𝑎! − ⋯ − 𝑦
where
𝑎!
appears
only
once.
If
this
process
is
repeated
for
all
vertices
that
appear
more
than
once
in
the
initial
walk,
then
all
𝑎!
where
1 ≤ 𝑘 ≤ 𝑛
will
appear
only
once
in
the
resulting
walk.
This
walk
will
be,
by
definition,
a
path.