EDGE-TO-VERTEX DETOUR MONOPHONIC NUMBER OF A GRAPH
For a connected graph G = (V, E) of order at least three, the monophonic distance d_m(u, v) is the length of a longest u − v monophonic path in G. For subsets A and B of V , the monophonic distance d_m(A, B) is defined as d_m(A, B) = min{d_m(x, y) :x ∈ A, y ∈ B}. A u − v path of length d_m(A, B) is...
שמור ב:
| Principais autores: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Conspress
2014-09-01
|
| סדרה: | Romanian Journal of Mathematics and Computer Science |
| נושאים: | |
| גישה מקוונת: | http://www.rjm-cs.ro/SanthakumaranTitusGanesmoorthy.pdf |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|