Title : Monophonic concepts in graphs

Type of Material: Thesis
Title: Monophonic concepts in graphs
Researcher: Balakrishnan P
Guide: Titus T
Publisher: Anna University
Place: Chennai
Year: 2015-02-10
Language: English
Dissertation/Thesis Note: PhD
Fulltext: Shodhganga

00000000ntm a2200000ua 4500
001293408
003IN-AhILN
0052018-08-14 02:14:25
008__180814t2015||||ii#||||g|m||||||||||eng||
035__|a(IN-AhILN)th_293408
040__|aANNA_600025|dIN-AhILN
041__|aeng
100__|aBalakrishnan P|eResearcher
245__|aMonophonic concepts in graphs
260__|aChennai|bAnna University|c2015-02-10
502__|bPhD
520__|aFor any two vertices x and y in a connected graph G an X y path is a monophonic path if it contains no chord and a longest X y monophonic path is called an x y detour monophonic path For any vertex x in G
700__|aTitus T|eGuide
856__|uhttp://shodhganga.inflibnet.ac.in/handle/10603/34526|yShodhganga
905__|anotification

User Feedback Comes Under This section.