I need a graph with 7 nodes and 9 edges, and I've created this one. However, I doubt it has a Hamiltonian path. Can someone help me?
(1 votes)
Loading...Hey, I hope you can help me. I've been given an inner circle measuring 70cm, and I'd like to use that to calculate the three sides of an isosceles triangle. I hope you can help me figure out how to do this.
Hi,, I wanted to ask why polynomials can have a maximum of N zeros.
Let's say I wrote a 3 and a 5 on one sheet. How does a computer know what a 3 and what a 5 is? A computer only knows zeros and ones?
I solved a complex LGS problem from a workbook, but it took me ages and I had to experiment a lot and use a value from the given solution to even get there. Now I'm wondering if I'm missing a trick or if there are no better solutions since I haven't found any better tips…
Obviously there is no Hamilton Circle, because you have several constrictions you need to visit several times to close the circle.
The graph has a Hamilton path but trivial.
So this graph wouldn’t fit into a task where I can’t have a Hamilton Trail and Hamilton Circle, would it?
No.
Just get two or three dead ends, then you don’t have a Hamilton path.
You need a Euler path?
Yes, I just found out. thank you anyway 🙂 🙏🏻
Something star-like, I think I could work. Three triangles with a common center or something.
Yes must be an euler path with 9 edges and 7 nodes
Many greetings from AuD at the tubs . The sign for radioactivity is by the way such a graph.