Sri Lalitha Rahsya Sahasranama – Kalpavruksha
Minimum Spanning Trees (MST) is a concept in graph theory of mathematics. In graph theory, a graph is an ordered pair, where G = (V, E) comprising a set of vertices or nodes (శీర్షములు) together with a set of edges (భుజములు). Below is the simple example of a ‘Graph G’ with three nodes and three edges.
A graph is cyclic in nature means that there is a path between every pair of vertices.
A spanning tree is a subset of a graph, which has all the vertices connected with minimum possible edges. Below is the example of maximum possible spanning trees of ‘Graph G’.
A complete graph can have maximum n^(n-2) number of spanning trees. In our example n=3 (three nodes), hence the maximum spanning trees can have are 3^(3-2)=3.
For a simple understanding a minimum spanning tree (MST) is s a spanning tree that connects all the vertices with minimum edges. Here the minimum edges are quantified with edge weights. Further explanation is out of scope of this article.
Minimum spanning trees are a great way to visualize the relationships among the vertices/nodes of a data or a group. MST is applied in various areas such as telecommunications, transport problem, stock markets etc.
Here I decided to apply this concept on ‘Sri Lalitha Rahsya Sahasranama’ considering each sloka/couplet as a vertices. With the help of ‘Matruka Sankya Namamu’ I could quantify each sloka/couplet and find the correlation between 182.5 slokas/couplets and build a minimum spanning tree. The resultant visual spectacular is the ‘Sri Lalitha Rahsya Sahasranama – Kalpavruksha (శ్రీ లలిత రహస్య నామసహస్ర – కల్పవృక్షము)’.