The Edge-To-Vertex Triangle Free Detor Distance in Graphs
For every connected graph G, the triangle free detour distance D∆f(u, v) is the length of a longest u- v triangle free path in G, where u, v are the vertices of G. A u-v triangle free path of length D∆f(u, v) is called the u-v triangle free detour. In this article, the edge-to-vertex triangle free...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Accademia Piceno Aprutina dei Velati
2022-12-01
|
| Series: | Ratio Mathematica |
| Subjects: | |
| Online Access: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/894 |