Abstract: In this paper, lower truncation and upper
truncation of a fuzzy
graph Gare defined. It
is proved that when Gis
a strong (complete) fuzzy graph, then and are strong
(complete) fuzzy graphs. It is proved by means of examples that converse need
not be true. Necessary and sufficient conditions for and to be strong
(complete) fuzzy graphs are obtained. Also the regularity property of as well as
of are
studied.
Keywords and phrases: fuzzy graph, lower truncation, upper truncation, strong fuzzy graph, complete fuzzy graph, adjacency sequence of a vertex, regular fuzzy graph.
