AbstractsBiology & Animal Science

Monophonic concepts in graphs;

by Balakrishnan P




Institution: Anna University
Department: Monophonic concepts in graphs
Year: 2015
Record ID: 1203621
Full text PDF: http://shodhganga.inflibnet.ac.in/handle/10603/34526


Abstract

For any two vertices x and y in a connected graph G an newlineX y path is a monophonic path if it contains no chord and a longest newlineX y monophonic path is called an x y detour monophonic path For newlineany vertex x in G newline newline%%%reference p132-135.