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 Nov 19 at 15:20
Thomas
996
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 Nov 19 at 15:20
Thomas
996
What have you tried so far?
– jwc845
Nov 19 at 15:37
@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
Nov 19 at 15:58
This might help: math.stackexchange.com/questions/3005438/…
– Just_a_newbie
Nov 24 at 10:44
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 Nov 19 at 15:20
Thomas
996
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 Nov 19 at 15:20
Thomas
996
asked Nov 19 at 15:20
Thomas
996
edited Nov 19 at 18:27
asked Nov 19 at 15:20
Thomas
996
asked Nov 19 at 15:20
Thomas
996
asked Nov 19 at 15:20
Thomas
996
996
What have you tried so far?
– jwc845
Nov 19 at 15:37
@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
Nov 19 at 15:58
This might help: math.stackexchange.com/questions/3005438/…
– Just_a_newbie
Nov 24 at 10:44
add a comment |
What have you tried so far?
– jwc845
Nov 19 at 15:37
@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
Nov 19 at 15:58
This might help: math.stackexchange.com/questions/3005438/…
– Just_a_newbie
Nov 24 at 10:44
What have you tried so far?
– jwc845
Nov 19 at 15:37
What have you tried so far?
– jwc845
Nov 19 at 15:37
@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
Nov 19 at 15:58
@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
Nov 19 at 15:58
This might help: math.stackexchange.com/questions/3005438/…
– Just_a_newbie
Nov 24 at 10:44
This might help: math.stackexchange.com/questions/3005438/…
– Just_a_newbie
Nov 24 at 10:44
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
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
Nov 19 at 15:37
@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
Nov 19 at 15:58
This might help: math.stackexchange.com/questions/3005438/…
– Just_a_newbie
Nov 24 at 10:44