Abstract
The \(k\)th graph power \(G^k\) of a graph \(G = (V , E)\) is the graph whose vertex set is \(V\) and in which two distinct vertices are adjacent if and only if their distance in \(G\) is...
Funding Information
  • National Natural Science Foundation of China (12071097)
  • National Natural Science Foundation of China (12371344)
  • Natural Science Foundation of Heilongjiang Province (YQ2024A009)
  • Nederlandse Organisatie voor Wetenschappelijk Onderzoek (VI.Vidi.213.085)
  • Nederlandse Organisatie voor Wetenschappelijk Onderzoek (OCENW.KLEIN.475)

This publication has 46 references indexed in Scilit: