Hi everyone
I'm struggling to proof something the Professor gave us. I asked several friends and no one know what to do. Basically is this:
"Proof for every simple bipartite Graph with n ≥ 1 vertex:
δ(G)+∆(G)≤ n.
Professor's Tip: Split you answer in two. First prove the follow:
If G is simple and bipartite with at least 3 vertex, so G has a vertex v ∈ V(G) that satysfies at least one of these properties:
• ∆(G−v)=∆(G)
• δ(G−v)= δ(G)
Now, proove by induction of N using these properties."
Guys, I don't know where to start and how to use these information! I checked several books( [West], [Chartrand-Zhang] and [Diestel]) and no one of them proved to be useful.
Sorry if my english was bad. Thanks!
I'm struggling to proof something the Professor gave us. I asked several friends and no one know what to do. Basically is this:
"Proof for every simple bipartite Graph with n ≥ 1 vertex:
δ(G)+∆(G)≤ n.
Professor's Tip: Split you answer in two. First prove the follow:
If G is simple and bipartite with at least 3 vertex, so G has a vertex v ∈ V(G) that satysfies at least one of these properties:
• ∆(G−v)=∆(G)
• δ(G−v)= δ(G)
Now, proove by induction of N using these properties."
Guys, I don't know where to start and how to use these information! I checked several books( [West], [Chartrand-Zhang] and [Diestel]) and no one of them proved to be useful.
Sorry if my english was bad. Thanks!