References
- Berge C. Hypergraphs: combinatorics of finite sets. Amsterdam: North-Holland; 1989.
- Graham RL, Pollack HO. On the addressing problem for loop switching. Bell Syst Tech J. 1971;50:2495–2519.
- Edelberg M, Garey MR, Graham RL. On the distance matrix of a tree. Discrete Math. 1976;14:23–39.
- Graham RL, Lovász L. Distance matrix polynomials of trees. Adv Math. 1978;29:60–88.
- Aouchiche M, Hansen P. Distance spectra of graphs: a survey. Linear Algebra Appl. 2014;458:301–386.
- Bose SS, Nath M, Paul S. Distance spectral radius of graphs with r pendent vertices. Linear Algebra Appl. 2011;435:2828–2836.
- Yu G, Jia H, Zhang H, et al. Some graft transformations and its applications on the distance spectral radius of a graph. Appl Math Lett. 2012;25:315–319.
- Xing R, Zhou B, Dong F. The effect of a graft transformation on distance spectral radius. Linear Algebra Appl. 2014;457:261–275.
- Sivasubramanian S. q-analogs of distance matrices of 3-hypertrees. Linear Algebra Appl. 2009;431:1234–1248.
- Lin H, Zhou B. Distance spectral radius of uniform hypergraphs. Linear Algebra Appl. 2016;506:564–578.