Abstract
Let ℌ be a hypergraph. The eccentric hypergraph ℌ] = of a hypergraph ℌ is the hypergraph that has the same vertex set as in ℌ and the edge set is defined by for any vertex other than x in is an eccentric vertex of x. In this paper we study about some results on eccentric k-uniform tight cycle.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
