Graphs with the Same Detour Matrix
| العنوان: | Graphs with the Same Detour Matrix |
|---|---|
| المؤلفون: | Milan Randić, Luz M. DeAlba, Frank E. Harris |
| المصدر: | Croatica Chemica Acta Volume 71 Issue 1 |
| بيانات النشر: | Croatian Chemical Society, 1998. |
| سنة النشر: | 1998 |
| مصطلحات موضوعية: | Computer Science::Social and Information Networks |
| الوصف: | The detour matrix (DD) of a graph has for its (i,j) entry the length of the longest path between vertices i and j. The sum of all entries above the main diagonal gives the detour index dd. Distinct graphs that have the same detour index have been reported in the literature. We examined such graphs and others that we have found and report on some of their regularities. We noticed that many graphs have not only the same detour index but also the same detour matrix. We considered in particular graphs for which the elements of the detour matrix are maximal. Such graphs are called saturated graphs. The detour matrix of a saturated graph is the same as that of the complete graph having the same number or vertices. |
| وصف الملف: | application/pdf |
| اللغة: | English |
| تدمد: | 1334-417X 0011-1643 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=od_______951::f82dd7fdd6d7a2b95a99926a5b260c34 https://hrcak.srce.hr/132324 |
| حقوق: | OPEN |
| رقم الأكسشن: | edsair.od.......951..f82dd7fdd6d7a2b95a99926a5b260c34 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 1334417X 00111643 |
|---|