Eulerian Path Analysis: Is My Figure Drawable?

  • Context: Undergrad 
  • Thread starter Thread starter Krypt0s
  • Start date Start date
  • Tags Tags
    Path
Click For Summary

Discussion Overview

The discussion revolves around the analysis of a specific graph to determine whether it can be drawn as an Eulerian path. Participants are examining the validity of the analysis presented by Krypt0s, which references graph theory principles.

Discussion Character

  • Debate/contested, Technical explanation

Main Points Raised

  • Krypt0s claims to have analyzed a graph and concluded that it has no Eulerian path due to the presence of four nodes with odd degrees.
  • Some participants question the depth of Krypt0s' analysis, suggesting it merely reproduces a proof without original analysis.
  • Others defend Krypt0s, stating that he correctly applied the relevant theorem and demonstrated the necessary conditions for the absence of an Eulerian path.
  • There is a focus on whether the analysis sufficiently addresses the requirements for proving the lack of an Eulerian path.

Areas of Agreement / Disagreement

Participants express differing views on the adequacy of Krypt0s' analysis. Some believe it is sufficient, while others argue it lacks original analysis and merely cites existing proofs. The discussion remains unresolved regarding the quality of the analysis.

Contextual Notes

There are references to specific theorems and conditions related to Eulerian paths, but the discussion does not clarify the details of these theorems or the specific graph in question.

Who May Find This Useful

Readers interested in graph theory, particularly in the context of Eulerian paths and the analysis of graph properties.

Physics news on Phys.org
Pardon me, but I don't see any analysis. All I see is a copy of the proof.
 
What you did is fine, Krypt0s.

farleyknight said:
Pardon me, but I don't see any analysis.
Krypt0s analyzed the graph in question and found four nodes in this particular graph that have an odd degree.
All I see is a copy of the proof.
Are we looking at the same page? Krypt0s used the theorem to prove the particular graph in question has no Eulerian path. What's wrong with that?
 
D H said:
What you did is fine, Krypt0s.


Krypt0s analyzed the graph in question and found four nodes in this particular graph that have an odd degree.

Are we looking at the same page? Krypt0s used the theorem to prove the particular graph in question has no Eulerian path. What's wrong with that?

I was looking at the text, not the graph.
 
I was looking at the text, too. All that is needed to prove that the graph in question has no Eulerian path is to (a) cite the relevant theorem and (b) show that the relevant conditions for lack of an Eulerian path apply. He did both.
 

Similar threads

Calculation of electrical mean free path in nanomaterials?
  • · Replies 0 ·
Replies
0
Views
3K
Uncertainty Error and Significant Figures in this Force Tables Lab
  • · Replies 4 ·
Replies
4
Views
3K
Is it possible to switch from physics to maths after undergrad?
  • · Replies 2 ·
Replies
2
Views
3K
Studying What Are the Best Steps for Self-Teaching Theoretical Physics?
  • · Replies 14 ·
Replies
14
Views
5K
Can a graph with no self loops and odd common neighbors have an Eulerian path?
  • · Replies 6 ·
Replies
6
Views
2K
High School Spivak's Calculus as a Prerequisite for General Topology
  • · Replies 25 ·
Replies
25
Views
5K
Undergrad Experiment distinguishes Standard QM vs Bohm: Asymmetric beam splitter
  • · Replies 15 ·
Replies
15
Views
3K
Undergrad What is the Purpose of Modal Analysis in Mechanical Systems?
  • · Replies 1 ·
Replies
1
Views
2K
Undergrad Photon interference and path differences
  • · Replies 18 ·
Replies
18
Views
2K
Courses Math vs. Physics: Choosing the Right Path for Graduate Studies
  • · Replies 3 ·
Replies
3
Views
2K