ramgorur
Reputation
Top tag
Next privilege 250 Rep.
View close votes
Badges
8
Newest
Impact
~716 people reached

• 0 helpful flags
• 18 votes cast

48 Actions

 May 28 awarded Critic May 28 accepted finding volume of an n-dimensional pyramid numerically May 28 comment finding volume of an n-dimensional pyramid numerically thanks, could you please give the matrix form for the $\det(v_1-v_0,v_2-v_0,\dots,v_{n+1}-v_0)$ term ? I don't quite understand what does it mean by $\det(a_1, a_2, a_3, \ldots, a_n)$ May 28 awarded Commentator May 28 comment finding volume of an n-dimensional pyramid numerically it's n-dimensional, corrected, sorry I don't know the exact math term for that. May 28 revised finding volume of an n-dimensional pyramid numerically added 40 characters in body May 28 asked finding volume of an n-dimensional pyramid numerically Feb 22 accepted Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? Feb 22 comment Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? gulp, have you just broke a record? Ellingham-Horton graph has 54 vertices and wiki says it's the lowest! Feb 22 comment Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? @LaarsHelenius yes. Feb 22 comment Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? @Casteels It's corrected, the graph is connected. Feb 22 revised Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? added 106 characters in body; edited title Feb 22 asked Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? Feb 21 accepted Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. Feb 21 comment Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. now it explains a lot, thanks. Feb 21 comment Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. ok, lets say we have an edge cut $C$ that contains a smaller edge cut $C'$, and suppose $C'$ does not contain any smaller edge cut anymore. So, $C'$ is minimal, then why we are not calling $C'$ as "minimum" (instead of minimal)? Feb 21 comment Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. could you please elaborate a bit more on "does not contain a smaller edge cut"? the only way to isolate a single vertex is to have a cut over all the edges connected to it, so why are we saying it as "minimal"? this is the only "cut" that we have and it's "minimum". Feb 21 revised Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. deleted 5 characters in body Feb 21 asked Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. Sep 24 awarded Autobiographer