Results 21 to 30 of about 8,394 (255)
Adjacent Vertex Distinguishing Coloring of Fuzzy Graphs
In this paper, we consider the adjacent vertex distinguishing proper edge coloring (for short, AVDPEC) and the adjacent vertex distinguishing total coloring (for short, AVDTC) of a fuzzy graph.
Zengtai Gong, Chen Zhang
doaj +1 more source
Fuzzy coloring and total fuzzy coloring of various types of intuitionistic fuzzy graphs [PDF]
In this paper, fuzzy coloring and total fuzzy coloring of intuitionistic fuzzy graphs are introduced. The fuzzy chromatic number, fuzzy chromatic index, total fuzzy chromatic number and total fuzzy chromatic index of both vertices and edges in ...
R. Buvaneswari, P. Revathy
doaj +1 more source
2-Quasitotal Fuzzy Graphs and Their Total Coloring
Coloring of fuzzy graphs has many real-life applications in combinatorial optimization problems like traffic light system, exam scheduling, and register allocation. The coloring of total fuzzy graphs and its applications are well studied. This manuscript
V. N. Srinivasa Rao Repalle +1 more
doaj +1 more source
A fuzzy graph is useful in representing structures of relationships between items where the existence of a concrete item (vertex) and relationship between two items (edge) are matters of degree.
Ashraf, S., Naz, S., Kerre, Etienne
openaire +2 more sources
Intuitionistic Fuzzy Graphs with Categorical Properties
The main purpose of this paper is to show the rationality of some operations, defined or to be defined, on intuitionistic fuzzy graphs. Firstly, three kinds of new product operations (called direct product, lexicographic product, and strong product) are ...
Hossein Rashmanlou +3 more
doaj +1 more source
Certain Types of Interval-Valued Fuzzy Graphs
We propose certain types of interval-valued fuzzy graphs including balanced interval-valued fuzzy graphs, neighbourly irregular interval-valued fuzzy graphs, neighbourly total irregular interval-valued fuzzy graphs, highly irregular interval-valued fuzzy
Muhammad Akram +2 more
doaj +1 more source
Set Domination in Fuzzy Graphs Using Strong Arcs
Set domination in fuzzy graphs is very useful for solving traffic problems during communication in computer networks and travelling networks. In this article, the concept of set domination in fuzzy graphs using strong arcs is introduced.
O.T. Manjusha
doaj +1 more source
Roughness in Fuzzy Cayley Graphs
Rough set theory is a worth noticing approach for inexact and uncertain system modelling. When rough set theory accompanies with fuzzy set theory, which both are a complementary generalization of set theory, they will be attended by potency in ...
M.H. Shahzamanian, B. Davvaz
doaj +1 more source
On Edge Fuzzy Line Graphs and their Fuzzy Congraphs [PDF]
In this paper, we introduce some new concepts of fuzzy graphs with the notion of degree of an edge in fuzzy line graphs and congraphs. Also, some properties and some lemmas of edge fuzzy line graphs and congraphs are studied.
Siyamak Firouzian +2 more
doaj +1 more source
Abstract An arc (u, v) in a fuzzy graph H is called strong if its weight is at least as great as the strength of connectedness of u and v when (u, v) is deleted. A strong path is a path whose arcs are all strong, and a geodesic is a shortest strong path between its end nodes. Let S be a set of nodes.
Kiran R. Bhutani, Azriel Rosenfeld
openaire +1 more source

