CATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
Authors
Abstract:
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ((POM)L-Fuzzy graphs) into thecategory of (POM)L-Fuzzy hypergraphs. Also we show that for each finiteobjects in the category of (POM)L-Fuzzy graphs, the coproduct exists, andunder a suitable condition the product also exists.
similar resources
category of (pom)l-fuzzy graphs and hypergraphs
in this note by considering a complete lattice l, we define thenotion of an l-fuzzy hyperrelation on a given non-empty set x. then wedefine the concepts of (pom)l-fuzzy graph, hypergraph and subhypergroupand obtain some related results. in particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (pom)l-fuzzy subhypergroups ...
full textFuzzy Graphs and Fuzzy Hypergraphs
Graph theory has numerous application to problems in systems analysis, operations research, economics, and transportation. However, in many cases, some aspects of a graph-theoretic problem may be uncertain. For example, the vehicle travel time or vehicle capacity on a road network may not be known exactly. In such cases, it is natural to deal with the uncertainty using the methods of fuzzy sets...
full textcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولsome properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولGraphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating minimal perfect hash functions which allow an arbitrary order to be specified for the keys. We show that almost all members of the family are space and time optimal, and we identify the one with mini...
full textSupersaturated graphs and hypergraphs
We shall consider graphs (hypergraphs) without loops and multiple edges . Let Ybe a family of so called prohibited graphs and ex (n, Y) denote the maximum number of edges (hyperedges) a graph (hypergraph) on n vertices can have without containing subgraphs from Y A graph (hypergraph) will be called supersaturated if it has more edges than ex (n, Y). If G has n vertices and ex (n, Y)=k edges (hy...
full textMy Resources
Journal title
volume 2 issue 1
pages 49- 63
publication date 2005-04-21
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023