Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The distance matrix of a simple graph G is $$DG=d_{i,j}$$, where $$d_{i,j}$$ is the distance beten the ith and jth vertices of G. The distance spectral radius of G, written $$\lambda _{1}G$$, is the largest eigenvalue of DG.  determine the distance spectral radius of the wheel graph $$W_{n}$$, a particular type of spider graphs, and the generalized Petersen graph Pn,i¾źk for $$k\in \{2,3\}$$.
['Fouzul Atik', 'Pratima Panigrahi']
I am writing a research paper on a idea Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs
[{"from": "human", "value": "I am writing a research paper on a idea Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The distance matrix of a simple graph G is $$DG=d_{i,j}$$, where $$d_{i,j}$$ is the distance beten the ith and jth vertices of G. The distance spectral radius of G, written $$\\lambda _{1}G$$, is the largest eigenvalue of DG.  determine the distance spectral radius of the wheel graph $$W_{n}$$, a particular type of spider graphs, and the generalized Petersen graph Pn,i\u00be\u017ak for $$k\\in \\{2,3\\}$$."}]