On lexicographic products of two intuitionistic fuzzy graphs
Abstract
In this paper, lexicographic products of two intuitionistic fuzzy graphs, namely, lexicographic min product and lexicographic max product which are analogous to the concept lexicographic product in crisp graph theory are defined. It is illustrated that the operations lexicographic products are not commutative. The connected effective and complete properties of the operations lexicographic products are studied. The degree of a vertex in the lexicographic products of two intuitionistic fuzzy graph is obtained. A relationship between the lexicographic min product and lexicographic max–product is also obtained.
Copyright © 2019 P. Syamala, K.R. Balasubramanian. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
P. Syamala, K. R. Balasubramanian, On lexicographic products of two intuitionistic fuzzy graphs, J. Math. Comput. Sci. 10 (2020), 136–149. https://doi.org/10.28919/jmcs/4311
BibTeX
@article{Syamala2020,
author = {Syamala, P. and Balasubramanian, K.R.},
title = {On lexicographic products of two intuitionistic fuzzy graphs},
journal = {J. Math. Comput. Sci.},
volume = {10},
year = {2020},
pages = {136--149},
doi = {10.28919/jmcs/4311}
}