Hello Everyone! So I am working on the proposal for Diameters and Eccentricities. First of all some reflections - 1. I think the project is incredible useful, because graph analysis, especially one dives deeper into the Eulerian and Hamlintonian simplify most analysis 2. The issues always start with higher degrees, or graphs with multiple structures, because those often required different ways of study
My approach to the same, after reading some of the reference material and online stuff is - 1. Identify the degrees of the vertices needed to be studied, its the first step towards elimination and decreasing the size of the problem set. 2. Since the graphs being analysed would be of a large number of edges and vertices, the next step would include isolating parts of the graph and then using them to study the maximum of diameters, the final datasets would contain these numbers which could then be judged for being the maximum or minimum values I do have a lot more to add, however I do not want to present more unstructured information, so I have kept it short. I would be grateful if anyone has any suggestions or recommendations for me on this project, or areas of improvement Shlok -- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-gsoc/3363f42b-2b1f-4610-a996-895c357821bb%40googlegroups.com.
