Read More
Date: 18-5-2022
1638
Date: 18-3-2022
1396
Date: 15-5-2022
869
|
The detour polynomial of a graph is the characteristic polynomial of the detour matrix of .
Precomputed detour polynomials for many named graphs are available in the Wolfram Language as GraphData[graph, "DetourPolynomial"].
Since a Hamilton-connected graph with vertex count has all off-diagonal matrix elements equal to , the detour polynomial of such a graph is given by .
The following table summarizes detour polynomials for some common classes of graphs. Here, is a Chebyshev polynomial of the first kind and is a Chebyshev polynomial of the second kind.
graph | detour polynomial |
Andrásfai graph | |
antiprism graph | |
barbell graph | |
book graph | |
cocktail party graph | |
complete bipartite graph | |
complete graph | |
complete tripartite graph | |
crossed prism graph | |
crown graph for | |
gear graph | |
halved cube graph | |
helm graph | |
hypercube graph | |
Keller graph | |
king graph | |
Möbius ladder | |
Mycielski graph | |
odd graph | |
path graph | |
prism graph | |
Sierpiński tetrahedron graph | |
star graph | |
wheel graph |
The following table summarizes the recurrence relations for detour polynomials for some simple classes of graphs.
graph | order | recurrence |
path graph | 5 |
Nikolić, S.; Trinajstić, N.; and Mihalić, A. "The Detour Matrix and the Detour Index." Ch. 6 in Topological Indices and Related Descriptors in QSAR and QSPR (Ed. J. Devillers A. T. and Balaban). Amsterdam, Netherlands: Gordon and Breach, pp. 279-306, 2000.
|
|
دراسة يابانية لتقليل مخاطر أمراض المواليد منخفضي الوزن
|
|
|
|
|
اكتشاف أكبر مرجان في العالم قبالة سواحل جزر سليمان
|
|
|
|
|
المجمع العلمي ينظّم ندوة حوارية حول مفهوم العولمة الرقمية في بابل
|
|
|