On 2014-03-27, Paul Mercat <merc...@yahoo.fr> wrote: > No, I have no idea of what will be the degree of the number field in which > my spectral radius belongs to. > But if I could compute the characteristic polynomial of the matrix, I could > have the minimal polynomial of the spectral radius (and that's what I mean > by exact value).
if your graph is highly irregular, the degree of the minimal polynomial will be not too far from the number of vertices, and so you'd be really out of luck. How do you obtain your graphs? Do they have any symmetry? -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
