F-Permutations induce Some Graphs and Matrices
نویسندگان
چکیده مقاله:
In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.
منابع مشابه
The Distance Matrices of Some Graphs Related to Wheel Graphs
A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. All graphs considered here are simple and connected. LetG be a simple connected graph with vertex set V(G) and edge set E(G).The distance between two vertices u, V ∈ V(G) is denoted by d uV and is defined as the length of the shortest path between u and V ...
متن کاملSome Graphs Related to Thompson's Group F
The Schreier graphs of Thompson’s group F with respect to the stabilizer of 12 and generators x0 and x1, and of its unitary representation in L2([0, 1]) induced by the standard action on the interval [0, 1] are explicitly described. The coamenability of the stabilizers of any finite set of dyadic rational numbers is established. The induced subgraph of the right Cayley graph of the positive mon...
متن کاملOn Types of Matrices and Centralizers of Matrices and Permutations
It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general captures more information; using this invariant the result on centralizers is extended to arbitrary fields. The converse is also proved: thus two matrices ha...
متن کاملF-index and coindex of some derived graphs
In this study, the explicit expressions for F-index and coindex of derived graphs such as a line graph, subdivision graph, vertex-semitotal graph, edge-semitotal graph, total graph and paraline graph (line graph of the subdivision graph) are obtained.
متن کاملRandom Unitary Matrices, Permutations and Painlevé
This paper is concerned with certain connections between the ensemble of n × n unitary matrices—specifically the characteristic function of the random variable tr(U)—and combinatorics—specifically Ulam’s problem concerning the distribution of the length of the longest increasing subsequence in permutation groups—and the appearance of Painlevé functions in the answers to apparently unrelated que...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 7 شماره None
صفحات 7- 20
تاریخ انتشار 2012-05
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023