Jernej
Reputation
1,966
Top tag
Next privilege 2,000 Rep.
 Dec7 comment Semi-hamiltonian graph. @user180834 Can you answer the question in the hint? Dec7 answered Semi-hamiltonian graph. Dec7 comment Semi-hamiltonian graph. What do you mean by semi-Hamiltonian? Dec4 asked Average number of linear factors in a monic polynomial of degree $n$ over $\mathbb{F}_p$ Nov29 comment Diameter of a Connected Graph @sam_rox Yes, you are right. Thanks for the remark, I've corrected the page. Nov21 accepted Determinant of the Kronecker product involving the identity Nov20 comment Determinant of the Kronecker product involving the identity @Surb Err you're right I mean the Kronecker product! Nov20 revised Determinant of the Kronecker product involving the identity added 4 characters in body; edited title Nov20 comment orbits/canonical labelling of colored graphs Hi! I am using Sage which AFAIK does not support this feature. Nov20 asked orbits/canonical labelling of colored graphs Nov20 asked Determinant of the Kronecker product involving the identity Nov11 accepted Number of words not having a subword of length k with only one letter Nov11 comment Number of words not having a subword of length k with only one letter Thanks, that was very useful! Do you perhaps see a way to obtain an asymptotic estimate? I don't see a good way given that the poles of $f(z)$ are not directly known. Nov9 asked Number of words not having a subword of length k with only one letter Nov1 comment Determine a formula for the number of triangles in the line graph $L(G)$ in term of quantities in $G$ Just some pointers - every triangle in $G$ is also a triangle in $L(G).$ If $v$ i a vertex of degree $d$ then its edges give rise to $K_{d}$ in $L(G).$ Nov1 comment Paper claiming a graph isomorphism that isn't actually an isomorphism? @Zaaier What exactly do you want to implement? Just for isomorphism testing there are many free implementations online. Oct28 comment Upper bound for the number of hamilton cycles in a cubic graph @Peter I forgot to mention that in this context $c$ can as well be infinity. Oct27 comment Upper bound for the number of hamilton cycles in a cubic graph Exactly. What you do know though is that the limit you mention is $\leq c$ for some $c > 0.$ Oct27 answered Upper bound for the number of hamilton cycles in a cubic graph Oct20 comment Proportion of asymmetric graphs I believe you can figure this out from the book by Godsil and Royle (algebraic graph theory) see page 24.