The connected detour monophonic number of a graph

The connected detour monophonic number of a graph

THE CONNECTED DETOUR MONOPHONIC NUMBER OF A GRAPH THE CONNECTED DETOUR MONOPHONIC NUMBER OF A GRAPH P. TITUS, A.P. SANTHAKUMARAN, K. GANESAMOORTHY [PDF] Abstract For a connected graph G = (V;E) of order at least two, a chord of a path P is an edge joining two non-adjacent vertices of P. A path P is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:TWMS journal of applied and engineering mathematics 2016-01, Vol.6 (1), p.75
Hauptverfasser: Titus, P, Santhakumaran, A.P, Ganesamoorthy, K
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:THE CONNECTED DETOUR MONOPHONIC NUMBER OF A GRAPH THE CONNECTED DETOUR MONOPHONIC NUMBER OF A GRAPH P. TITUS, A.P. SANTHAKUMARAN, K. GANESAMOORTHY [PDF] Abstract For a connected graph G = (V;E) of order at least two, a chord of a path P is an edge joining two non-adjacent vertices of P. A path P is called a monophonic path if it is a chordless path. A longest x
ISSN:2146-1147
2146-1147