vertices and edges on a cycle
up vote
0
down vote
favorite
Show that if a simple graph with at least two vertices is connected and has no cut vertices, then any two vertices lie on a cycle and any two edges lie on a cycle.
I assume if $G$ is connected and has no cut vertices, then if we remove any vertex from $G$, the remaining graph is still connected. And does that automatically mean any two vertices lie on a cycle and any two edges lie on a cycle?
graph-theory
asked yesterday
Thomas
896
add a comment |
up vote
0
down vote
favorite
Show that if a simple graph with at least two vertices is connected and has no cut vertices, then any two vertices lie on a cycle and any two edges lie on a cycle.
I assume if $G$ is connected and has no cut vertices, then if we remove any vertex from $G$, the remaining graph is still connected. And does that automatically mean any two vertices lie on a cycle and any two edges lie on a cycle?
graph-theory
asked yesterday
Thomas
896
What have you tried so far?
– jwc845
yesterday
@jwc845 So I assume if $G$ is connected and has no cut vertices, then if we remove any vertex from $G$, the remaining graph is still connected. And does that automatically mean any two vertices lie on a cycle and any two edges lie on a cycle?
– Thomas
yesterday
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Show that if a simple graph with at least two vertices is connected and has no cut vertices, then any two vertices lie on a cycle and any two edges lie on a cycle.
I assume if $G$ is connected and has no cut vertices, then if we remove any vertex from $G$, the remaining graph is still connected. And does that automatically mean any two vertices lie on a cycle and any two edges lie on a cycle?
graph-theory
asked yesterday
Thomas
896
Show that if a simple graph with at least two vertices is connected and has no cut vertices, then any two vertices lie on a cycle and any two edges lie on a cycle.
I assume if $G$ is connected and has no cut vertices, then if we remove any vertex from $G$, the remaining graph is still connected. And does that automatically mean any two vertices lie on a cycle and any two edges lie on a cycle?
graph-theory
graph-theory
asked yesterday
Thomas
896
asked yesterday
Thomas
896
edited yesterday
asked yesterday
Thomas
896
asked yesterday
Thomas
896
asked yesterday
Thomas
896
896
What have you tried so far?
– jwc845
yesterday
@jwc845 So I assume if $G$ is connected and has no cut vertices, then if we remove any vertex from $G$, the remaining graph is still connected. And does that automatically mean any two vertices lie on a cycle and any two edges lie on a cycle?
– Thomas
yesterday
add a comment |
What have you tried so far?
– jwc845
yesterday
@jwc845 So I assume if $G$ is connected and has no cut vertices, then if we remove any vertex from $G$, the remaining graph is still connected. And does that automatically mean any two vertices lie on a cycle and any two edges lie on a cycle?
– Thomas
yesterday
What have you tried so far?
– jwc845
yesterday
What have you tried so far?
– jwc845
yesterday
@jwc845 So I assume if $G$ is connected and has no cut vertices, then if we remove any vertex from $G$, the remaining graph is still connected. And does that automatically mean any two vertices lie on a cycle and any two edges lie on a cycle?
– Thomas
yesterday
@jwc845 So I assume if $G$ is connected and has no cut vertices, then if we remove any vertex from $G$, the remaining graph is still connected. And does that automatically mean any two vertices lie on a cycle and any two edges lie on a cycle?
– Thomas
yesterday
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005058%2fvertices-and-edges-on-a-cycle%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
What have you tried so far?
– jwc845
yesterday
@jwc845 So I assume if $G$ is connected and has no cut vertices, then if we remove any vertex from $G$, the remaining graph is still connected. And does that automatically mean any two vertices lie on a cycle and any two edges lie on a cycle?
– Thomas
yesterday