Bounds of Extreme Energy of an Intuitionistic Fuzzy Directed Graph

We are considering the website network http://www.pantechsolutions.net/ of the web navigation of the customers. This website network can be representing as an intuitionistic fuzzy directed graph by means of considering the navigation of the customers. In this intuitionistic fuzzy directed graph, the links are considering as vertices and the path between the links are considering as edges. The weightage of each edge are considering as number of visitors getting the link from one link to another link (membership value), number of visitors not getting the link, i.e. under traffic from one link to another link (non-membership value) and drop off case (intuitionistic fuzzy index). For this graph we are determining the maximum, minimum energies and its upper, lower bounds.