The Edge Fixing Edge-To-Vertex Detour Number Of A Graph

We introduce the concept of the total edge fixing edge-to-vertex detour setof a connected graph . Let e be an edge of a graph . A set is called an edge fixing edge-to-vertex detour set of a connected graph if every edge of lies on an detour, where . The edge fixing edge-to-vertex detour number of is the minimum cardinality of its edge fixing edge-to-vertex detour sets and any edge fixing edge-to-vertex detour set of cardinality is an -set of Connected graphs of order p with edge fixing edge-to-vertex detour number 1 or are characterized. Theedge fixing edge-to-vertex detour number for some standard graphs are determined. It is shown that for every pair of positive integers with 2 there exists a connected graph such that and for some edge .

Keywords

detour set ,edge-to-vertex detour set , edge fixing edge –to-vertex detour set,edge fixing edge - to vertex detour set,edge fixing edge - to - vertex detour number, detour set ,edge-to-vertex detour set , edge fixing edge –to-vertex detour set,edge fixing edge - to vertex detour set,edge fixing edge - to - vertex detour number

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average