Special Issue "Discrete Mathematics and Symmetry"

A special issue of Symmetry (ISSN 2073-8994).

Deadline for manuscript submissions: 31 August 2019.

Special Issue Editor

Guest Editor
Prof. Dr. Angel Garrido

Department of Fundamental Mathematics, Faculty of Sciences, UNED, Paseo Senda del Rey No. 9, 28040 Madrid, Spain
Website | E-Mail
Phone: +34 91 3987237
Fax: +34 91 3987237
Interests: Mathematical Analysis; Measure Theory; Fuzzy Measures, in particular symmetry and entropy; Graph Theory; Discrete Mathematics; Automata Theory; Mathematical Education; Heuristics; Automata Theory; Artificial Intelligence

Special Issue Information

Dear Colleagues,

One of the core concepts essential to understanding natural phenomena and the dynamics of social systems is the concept of “relation”. Furthermore, scientists rely on relational structures with high levels of symmetry because of their optimal behavior and high performance. Human friendships, social and interconnection networks, traffic systems, chemical structures, etc., can be expressed as relational structures. A mathematical model capturing the essence of this situation is a combinatorial object exhibiting a high level of symmetry, and the underlying mathematical discipline is algebraic combinatorics—the most vivid expression of the concept of symmetry in discrete mathematics.

The purpose of this Special Issue of the journal Symmetry is to present some recent developments, as well as possible future directions in algebraic combinatorics. Special emphasis will be given to the concept of symmetry in graphs, finite geometries, and designs.

Contributions pursuing solutions of long standing open problems in algebraic combinatorics, as well as contributions opening up new research topics encompassing symmetry within the boundaries of discrete mathematics but with the possibility of transcending these boundaries, are welcome.

Prof. Dr. Angel Garrido
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Symmetry is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • algebraic combinatorics
  • discrete mathematics
  • symmetries of graphs
  • symmetry in finite geometries and designs

Published Papers (26 papers)

View options order results:
result details:
Displaying articles 1-26
Export citation of selected articles as:

Research

Open AccessArticle
Edge Even Graceful Labeling of Cylinder Grid Graph
Symmetry 2019, 11(4), 584; https://doi.org/10.3390/sym11040584
Received: 26 March 2019 / Revised: 12 April 2019 / Accepted: 14 April 2019 / Published: 22 April 2019
PDF Full-text (7472 KB) | HTML Full-text | XML Full-text
Abstract
Edge even graceful labeling (e.e.g., l.) of graphs is a modular technique of edge labeling of graphs, introduced in 2017. An e.e.g., l. of simple finite undirected graph G=(V(G),E(G)) of order [...] Read more.
Edge even graceful labeling (e.e.g., l.) of graphs is a modular technique of edge labeling of graphs, introduced in 2017. An e.e.g., l. of simple finite undirected graph G = ( V ( G ) , E ( G ) ) of order P = | ( V ( G ) | and size q = | E ( G ) | is a bijection f : E ( G ) { 2 , 4 , , 2 q } , such that when each vertex v V ( G ) is assigned the modular sum of the labels (images of f ) of the edges incident to v , the resulting vertex labels are distinct mod 2 r , where r = max ( p , q ) . In this work, the family of cylinder grid graphs are studied. Explicit formulas of e.e.g., l. for all of the cases of each member of this family have been proven. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Involution Abel–Grassmann’s Groups and Filter Theory of Abel–Grassmann’s Groups
Symmetry 2019, 11(4), 553; https://doi.org/10.3390/sym11040553
Received: 12 March 2019 / Revised: 5 April 2019 / Accepted: 8 April 2019 / Published: 17 April 2019
PDF Full-text (869 KB) | HTML Full-text | XML Full-text
Abstract
In this paper, some basic properties and structure characterizations of AG-groups are further studied. First, some examples of infinite AG-groups are given, and weak commutative, alternative and quasi-cancellative AG-groups are discussed. Second, two new concepts of involution AG-group and generalized involution AG-group are [...] Read more.
In this paper, some basic properties and structure characterizations of AG-groups are further studied. First, some examples of infinite AG-groups are given, and weak commutative, alternative and quasi-cancellative AG-groups are discussed. Second, two new concepts of involution AG-group and generalized involution AG-group are proposed, the relationships among (generalized) involution AG-groups, commutative groups and AG-groups are investigated, and the structure theorems of (generalized) involution AG-groups are proved. Third, the notion of filter of an AG-group is introduced, the congruence relation is constructed from arbitrary filter, and the corresponding quotient structure and homomorphism theorems are established. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Isoperimetric Numbers of Randomly Perturbed Intersection Graphs
Symmetry 2019, 11(4), 452; https://doi.org/10.3390/sym11040452
Received: 2 February 2019 / Revised: 26 March 2019 / Accepted: 27 March 2019 / Published: 1 April 2019
PDF Full-text (297 KB) | HTML Full-text | XML Full-text
Abstract
Social networks describe social interactions between people, which are often modeled by intersection graphs. In this paper, we propose an intersection graph model that is induced by adding a sparse random bipartite graph to a given bipartite graph. Under some mild conditions, we [...] Read more.
Social networks describe social interactions between people, which are often modeled by intersection graphs. In this paper, we propose an intersection graph model that is induced by adding a sparse random bipartite graph to a given bipartite graph. Under some mild conditions, we show that the vertex–isoperimetric number and the edge–isoperimetric number of the randomly perturbed intersection graph on n vertices are Ω ( 1 / ln n ) asymptomatically almost surely. Numerical simulations for small graphs extracted from two real-world social networks, namely, the board interlocking network and the scientific collaboration network, were performed. It was revealed that the effect of increasing isoperimetric numbers (i.e., expansion properties) on randomly perturbed intersection graphs is presumably independent of the order of the network. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Generalized Permanental Polynomials of Graphs
Symmetry 2019, 11(2), 242; https://doi.org/10.3390/sym11020242
Received: 28 January 2019 / Accepted: 14 February 2019 / Published: 16 February 2019
PDF Full-text (761 KB) | HTML Full-text | XML Full-text
Abstract
The search for complete graph invariants is an important problem in graph theory and computer science. Two networks with a different structure can be distinguished from each other by complete graph invariants. In order to find a complete graph invariant, we introduce the [...] Read more.
The search for complete graph invariants is an important problem in graph theory and computer science. Two networks with a different structure can be distinguished from each other by complete graph invariants. In order to find a complete graph invariant, we introduce the generalized permanental polynomials of graphs. Let G be a graph with adjacency matrix A ( G ) and degree matrix D ( G ) . The generalized permanental polynomial of G is defined by P G ( x , μ ) = per ( x I ( A ( G ) μ D ( G ) ) ) . In this paper, we compute the generalized permanental polynomials for all graphs on at most 10 vertices, and we count the numbers of such graphs for which there is another graph with the same generalized permanental polynomial. The present data show that the generalized permanental polynomial is quite efficient for distinguishing graphs. Furthermore, we can write P G ( x , μ ) in the coefficient form i = 0 n c μ i ( G ) x n i and obtain the combinatorial expressions for the first five coefficients c μ i ( G ) ( i = 0 , 1 , , 4 ) of P G ( x , μ ) . Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Dynamics Models of Synchronized Piecewise Linear Discrete Chaotic Systems of High Order
Symmetry 2019, 11(2), 236; https://doi.org/10.3390/sym11020236
Received: 17 January 2019 / Revised: 30 January 2019 / Accepted: 11 February 2019 / Published: 15 February 2019
Cited by 5 | PDF Full-text (2000 KB) | HTML Full-text | XML Full-text
Abstract
This paper deals with the methods for investigating the nonlinear dynamics of discrete chaotic systems (DCS) applied to piecewise linear systems of the third order. The paper proposes an approach to the analysis of the systems under research and their improvement. Thus, effective [...] Read more.
This paper deals with the methods for investigating the nonlinear dynamics of discrete chaotic systems (DCS) applied to piecewise linear systems of the third order. The paper proposes an approach to the analysis of the systems under research and their improvement. Thus, effective and mathematically sound methods for the analysis of nonlinear motions in the models under consideration are proposed. It makes it possible to obtain simple calculated relations for determining the basic dynamic characteristics of systems. Based on these methods, the authors developed algorithms for calculating the dynamic characteristics of discrete systems, i.e. areas of the existence of steady-state motion, areas of stability, capture band, and parameters of transients. By virtue of the developed methods and algorithms, the dynamic modes of several models of discrete phase synchronization systems can be analyzed. They are as follows: Pulsed and digital different orders, dual-ring systems of various types, including combined ones, and systems with cyclic interruption of auto-tuning. The efficiency of various devices for information processing, generation and stabilization could be increased by using the mentioned discrete synchronization systems on the grounds of the results of the analysis. We are now developing original software for analyzing the dynamic characteristics of various classes of discrete phase synchronization systems, based on the developed methods and algorithms. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Determining Crossing Number of Join of the Discrete Graph with Two Symmetric Graphs of Order Five
Symmetry 2019, 11(2), 123; https://doi.org/10.3390/sym11020123
Received: 19 December 2018 / Revised: 17 January 2019 / Accepted: 18 January 2019 / Published: 22 January 2019
PDF Full-text (437 KB) | HTML Full-text | XML Full-text
Abstract
The main aim of the paper is to give the crossing number of the join product G+Dn for the disconnected graph G of order five consisting of one isolated vertex and of one vertex incident with some vertex of the [...] Read more.
The main aim of the paper is to give the crossing number of the join product G + D n for the disconnected graph G of order five consisting of one isolated vertex and of one vertex incident with some vertex of the three-cycle, and D n consists of n isolated vertices. In the proofs, the idea of the new representation of the minimum numbers of crossings between two different subgraphs that do not cross the edges of the graph G by the graph of configurations G D in the considered drawing D of G + D n will be used. Finally, by adding some edges to the graph G, we are able to obtain the crossing numbers of the join product with the discrete graph D n and with the path P n on n vertices for three other graphs. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Edge Even Graceful Labeling of Polar Grid Graphs
Symmetry 2019, 11(1), 38; https://doi.org/10.3390/sym11010038
Received: 6 December 2018 / Revised: 20 December 2018 / Accepted: 23 December 2018 / Published: 2 January 2019
Cited by 2 | PDF Full-text (6172 KB) | HTML Full-text | XML Full-text
Abstract
Edge Even Graceful Labelingwas first defined byElsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph G with p vertices and q edges is a bijection f from the edges of the graph to the set {2, [...] Read more.
Edge Even Graceful Labelingwas first defined byElsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph G with p vertices and q edges is a bijection f from the edges of the graph to the set { 2 , 4 , , 2 q } such that, when each vertex is assigned the sum of all edges incident to it mod 2 r where r = max { p , q } , the resulting vertex labels are distinct. In this paper we proved necessary and sufficient conditions for the polar grid graph to be edge even graceful graph. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessFeature PaperArticle
Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices of Generalized Bridge Molecular Graphs
Symmetry 2018, 10(12), 751; https://doi.org/10.3390/sym10120751
Received: 29 November 2018 / Revised: 12 December 2018 / Accepted: 13 December 2018 / Published: 14 December 2018
Cited by 1 | PDF Full-text (698 KB) | HTML Full-text | XML Full-text
Abstract
Topological indices are graph invariants computed by the distance or degree of vertices of the molecular graph. In chemical graph theory, topological indices have been successfully used in describing the structures and predicting certain physicochemical properties of chemical compounds. In this paper, we [...] Read more.
Topological indices are graph invariants computed by the distance or degree of vertices of the molecular graph. In chemical graph theory, topological indices have been successfully used in describing the structures and predicting certain physicochemical properties of chemical compounds. In this paper, we propose a definition of generalized bridge molecular graphs that can model more kinds of long chain polymerization products than the bridge molecular graphs, and provide some results of the edge versions of atom-bond connectivity ( A B C e ) and geometric arithmetic ( G A e ) indices for some generalized bridge molecular graphs, which have regular, periodic and symmetrical structures. The results of this paper offer promising prospects in the applications for chemical and material engineering, especially in chemical industry research. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Sufficient Conditions for Triangular Norms Preserving ⊗-Convexity
Symmetry 2018, 10(12), 729; https://doi.org/10.3390/sym10120729
Received: 5 November 2018 / Revised: 25 November 2018 / Accepted: 30 November 2018 / Published: 7 December 2018
PDF Full-text (236 KB) | HTML Full-text | XML Full-text
Abstract
The convexity in triangular norm (for short, ⊗−convexity) is a generalization of Zadeh’s quasiconvexity. The aggregation of two ⊗−convex sets is under the aggregation operator ⊗ is also ⊗−convex, but the aggregation operator ⊗ is not unique. To solve it in complexity, in [...] Read more.
The convexity in triangular norm (for short, ⊗−convexity) is a generalization of Zadeh’s quasiconvexity. The aggregation of two ⊗−convex sets is under the aggregation operator ⊗ is also ⊗−convex, but the aggregation operator ⊗ is not unique. To solve it in complexity, in the present paper, we give some sufficient conditions for aggregation operators preserve ⊗−convexity. In particular, when aggregation operators are triangular norms, we have that several results such as arbitrary triangular norm preserve D convexity and a convexity on bounded lattices, M preserves H convexity in the real unite interval [ 0 , 1 ] . Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessFeature PaperArticle
A Novel Edge Detection Method Based on the Regularized Laplacian Operation
Symmetry 2018, 10(12), 697; https://doi.org/10.3390/sym10120697
Received: 12 November 2018 / Revised: 21 November 2018 / Accepted: 22 November 2018 / Published: 3 December 2018
PDF Full-text (2807 KB) | HTML Full-text | XML Full-text
Abstract
In this paper, an edge detection method based on the regularized Laplacian operation is given. The Laplacian operation has been used extensively as a second-order edge detector due to its variable separability and rotation symmetry. Since the image data might contain some noises [...] Read more.
In this paper, an edge detection method based on the regularized Laplacian operation is given. The Laplacian operation has been used extensively as a second-order edge detector due to its variable separability and rotation symmetry. Since the image data might contain some noises inevitably, regularization methods should be introduced to overcome the instability of Laplacian operation. By rewriting the Laplacian operation as an integral equation of the first kind, a regularization based on partial differential equation (PDE) can be used to compute the Laplacian operation approximately. We first propose a novel edge detection algorithm based on the regularized Laplacian operation. Considering the importance of the regularization parameter, an unsupervised choice strategy of the regularization parameter is introduced subsequently. Finally, the validity of the proposed edge detection algorithm is shown by some comparison experiments. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
The Complexity of Some Classes of Pyramid Graphs Created from a Gear Graph
Symmetry 2018, 10(12), 689; https://doi.org/10.3390/sym10120689
Received: 8 November 2018 / Revised: 22 November 2018 / Accepted: 23 November 2018 / Published: 2 December 2018
Cited by 3 | PDF Full-text (1615 KB) | HTML Full-text | XML Full-text
Abstract
The methods of measuring the complexity (spanning trees) in a finite graph, a problem related to various areas of mathematics and physics, have been inspected by many mathematicians and physicists. In this work, we defined some classes of pyramid graphs created by a [...] Read more.
The methods of measuring the complexity (spanning trees) in a finite graph, a problem related to various areas of mathematics and physics, have been inspected by many mathematicians and physicists. In this work, we defined some classes of pyramid graphs created by a gear graph then we developed the Kirchhoff’s matrix tree theorem method to produce explicit formulas for the complexity of these graphs, using linear algebra, matrix analysis techniques, and employing knowledge of Chebyshev polynomials. Finally, we gave some numerical results for the number of spanning trees of the studied graphs. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Novel Three-Way Decisions Models with Multi-Granulation Rough Intuitionistic Fuzzy Sets
Symmetry 2018, 10(11), 662; https://doi.org/10.3390/sym10110662
Received: 27 October 2018 / Revised: 11 November 2018 / Accepted: 16 November 2018 / Published: 21 November 2018
Cited by 3 | PDF Full-text (704 KB) | HTML Full-text | XML Full-text
Abstract
The existing construction methods of granularity importance degree only consider the direct influence of single granularity on decision-making; however, they ignore the joint impact from other granularities when carrying out granularity selection. In this regard, we have the following improvements. First of all, [...] Read more.
The existing construction methods of granularity importance degree only consider the direct influence of single granularity on decision-making; however, they ignore the joint impact from other granularities when carrying out granularity selection. In this regard, we have the following improvements. First of all, we define a more reasonable granularity importance degree calculating method among multiple granularities to deal with the above problem and give a granularity reduction algorithm based on this method. Besides, this paper combines the reduction sets of optimistic and pessimistic multi-granulation rough sets with intuitionistic fuzzy sets, respectively, and their related properties are shown synchronously. Based on this, to further reduce the redundant objects in each granularity of reduction sets, four novel kinds of three-way decisions models with multi-granulation rough intuitionistic fuzzy sets are developed. Moreover, a series of concrete examples can demonstrate that these joint models not only can remove the redundant objects inside each granularity of the reduction sets, but also can generate much suitable granularity selection results using the designed comprehensive score function and comprehensive accuracy function of granularities. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Maximum Detour–Harary Index for Some Graph Classes
Symmetry 2018, 10(11), 608; https://doi.org/10.3390/sym10110608
Received: 12 September 2018 / Revised: 19 October 2018 / Accepted: 22 October 2018 / Published: 7 November 2018
PDF Full-text (466 KB) | HTML Full-text | XML Full-text
Abstract
The definition of a Detour–Harary index is ωH(G)=12u,vV(G)1l(u,v|G), where G is a simple and connected graph, and [...] Read more.
The definition of a Detour–Harary index is ω H ( G ) = 1 2 u , v V ( G ) 1 l ( u , v | G ) , where G is a simple and connected graph, and l ( u , v | G ) is equal to the length of the longest path between vertices u and v. In this paper, we obtained the maximum Detour–Harary index about unicyclic graphs, bicyclic graphs, and cacti, respectively. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessFeature PaperArticle
Q-Filters of Quantum B-Algebras and Basic Implication Algebras
Symmetry 2018, 10(11), 573; https://doi.org/10.3390/sym10110573
Received: 26 September 2018 / Revised: 25 October 2018 / Accepted: 26 October 2018 / Published: 1 November 2018
Cited by 10 | PDF Full-text (298 KB) | HTML Full-text | XML Full-text
Abstract
The concept of quantum B-algebra was introduced by Rump and Yang, that is, unified algebraic semantics for various noncommutative fuzzy logics, quantum logics, and implication logics. In this paper, a new notion of q-filter in quantum B-algebra is proposed, and quotient structures are [...] Read more.
The concept of quantum B-algebra was introduced by Rump and Yang, that is, unified algebraic semantics for various noncommutative fuzzy logics, quantum logics, and implication logics. In this paper, a new notion of q-filter in quantum B-algebra is proposed, and quotient structures are constructed by q-filters (in contrast, although the notion of filter in quantum B-algebra has been defined before this paper, but corresponding quotient structures cannot be constructed according to the usual methods). Moreover, a new, more general, implication algebra is proposed, which is called basic implication algebra and can be regarded as a unified frame of general fuzzy logics, including nonassociative fuzzy logics (in contrast, quantum B-algebra is not applied to nonassociative fuzzy logics). The filter theory of basic implication algebras is also established. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Open AccessArticle
Fuzzy Normed Rings
Symmetry 2018, 10(10), 515; https://doi.org/10.3390/sym10100515
Received: 12 September 2018 / Revised: 6 October 2018 / Accepted: 8 October 2018 / Published: 16 October 2018
Cited by 1 | PDF Full-text (227 KB) | HTML Full-text | XML Full-text
Abstract
In this paper, the concept of fuzzy normed ring is introduced and some basic properties related to it are established. Our definition of normed rings on fuzzy sets leads to a new structure, which we call a fuzzy normed ring. We define fuzzy [...] Read more.
In this paper, the concept of fuzzy normed ring is introduced and some basic properties related to it are established. Our definition of normed rings on fuzzy sets leads to a new structure, which we call a fuzzy normed ring. We define fuzzy normed ring homomorphism, fuzzy normed subring, fuzzy normed ideal, fuzzy normed prime ideal, and fuzzy normed maximal ideal of a normed ring, respectively. We show some algebraic properties of normed ring theory on fuzzy sets, prove theorems, and give relevant examples. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Open AccessArticle
Invariant Graph Partition Comparison Measures
Symmetry 2018, 10(10), 504; https://doi.org/10.3390/sym10100504
Received: 10 September 2018 / Revised: 10 October 2018 / Accepted: 11 October 2018 / Published: 15 October 2018
PDF Full-text (485 KB) | HTML Full-text | XML Full-text | Supplementary Files
Abstract
Symmetric graphs have non-trivial automorphism groups. This article starts with the proof that all partition comparison measures we have found in the literature fail on symmetric graphs, because they are not invariant with regard to the graph automorphisms. By the construction of a [...] Read more.
Symmetric graphs have non-trivial automorphism groups. This article starts with the proof that all partition comparison measures we have found in the literature fail on symmetric graphs, because they are not invariant with regard to the graph automorphisms. By the construction of a pseudometric space of equivalence classes of permutations and with Hausdorff’s and von Neumann’s methods of constructing invariant measures on the space of equivalence classes, we design three different families of invariant measures, and we present two types of invariance proofs. Last, but not least, we provide algorithms for computing invariant partition comparison measures as pseudometrics on the partition space. When combining an invariant partition comparison measure with its classical counterpart, the decomposition of the measure into a structural difference and a difference contributed by the group automorphism is derived. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
A Multi-Granularity 2-Tuple QFD Method and Application to Emergency Routes Evaluation
Symmetry 2018, 10(10), 484; https://doi.org/10.3390/sym10100484
Received: 23 September 2018 / Revised: 7 October 2018 / Accepted: 8 October 2018 / Published: 11 October 2018
Cited by 1 | PDF Full-text (9026 KB) | HTML Full-text | XML Full-text
Abstract
Quality function deployment (QFD) is an effective approach to satisfy the customer requirements (CRs). Furthermore, accurately prioritizing the engineering characteristics (ECs) as the core of QFD is considered as a group decision making (GDM) problem. In order to availably [...] Read more.
Quality function deployment (QFD) is an effective approach to satisfy the customer requirements (CRs). Furthermore, accurately prioritizing the engineering characteristics (ECs) as the core of QFD is considered as a group decision making (GDM) problem. In order to availably deal with various preferences and the vague information of different experts on a QFD team, multi-granularity 2-tuple linguistic representation is applied to elucidate the relationship and correlation between CRs and ECs without loss of information. In addition, the importance of CRs is determined using the best worst method (BWM), which is more applicable and has good consistency. Furthermore, we propose considering the relationship matrix and correlation matrix method to prioritize ECs. Finally, an example about evaluating emergency routes of metro station is proposed to illustrate the validity of the proposed methodology. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
The Structure Theorems of Pseudo-BCI Algebras in Which Every Element is Quasi-Maximal
Symmetry 2018, 10(10), 465; https://doi.org/10.3390/sym10100465
Received: 19 September 2018 / Revised: 28 September 2018 / Accepted: 29 September 2018 / Published: 8 October 2018
Cited by 1 | PDF Full-text (503 KB) | HTML Full-text | XML Full-text
Abstract
For mathematical fuzzy logic systems, the study of corresponding algebraic structures plays an important role. Pseudo-BCI algebra is a class of non-classical logic algebras, which is closely related to various non-commutative fuzzy logic systems. The aim of this paper is focus on the [...] Read more.
For mathematical fuzzy logic systems, the study of corresponding algebraic structures plays an important role. Pseudo-BCI algebra is a class of non-classical logic algebras, which is closely related to various non-commutative fuzzy logic systems. The aim of this paper is focus on the structure of a special class of pseudo-BCI algebras in which every element is quasi-maximal (call it QM-pseudo-BCI algebras in this paper). First, the new notions of quasi-maximal element and quasi-left unit element in pseudo-BCK algebras and pseudo-BCI algebras are proposed and some properties are discussed. Second, the following structure theorem of QM-pseudo-BCI algebra is proved: every QM-pseudo-BCI algebra is a KG-union of a quasi-alternating BCK-algebra and an anti-group pseudo-BCI algebra. Third, the new notion of weak associative pseudo-BCI algebra (WA-pseudo-BCI algebra) is introduced and the following result is proved: every WA-pseudo-BCI algebra is a KG-union of a quasi-alternating BCK-algebra and an Abel group. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
A Note on the Minimum Size of a Point Set Containing Three Nonintersecting Empty Convex Polygons
Symmetry 2018, 10(10), 447; https://doi.org/10.3390/sym10100447
Received: 6 September 2018 / Revised: 23 September 2018 / Accepted: 26 September 2018 / Published: 29 September 2018
PDF Full-text (1715 KB) | HTML Full-text | XML Full-text
Abstract
Let P be a planar point set with no three points collinear, k points of P be a k-hole of P if the k points are the vertices of a convex polygon without points of P. This article proves 13 is the [...] Read more.
Let P be a planar point set with no three points collinear, k points of P be a k-hole of P if the k points are the vertices of a convex polygon without points of P. This article proves 13 is the smallest integer such that any planar points set containing at least 13 points with no three points collinear, contains a 3-hole, a 4-hole and a 5-hole which are pairwise disjoint. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Multi-Granulation Graded Rough Intuitionistic Fuzzy Sets Models Based on Dominance Relation
Symmetry 2018, 10(10), 446; https://doi.org/10.3390/sym10100446
Received: 7 August 2018 / Revised: 22 September 2018 / Accepted: 26 September 2018 / Published: 28 September 2018
Cited by 1 | PDF Full-text (1190 KB) | HTML Full-text | XML Full-text
Abstract
From the perspective of the degrees of classification error, we proposed graded rough intuitionistic fuzzy sets as the extension of classic rough intuitionistic fuzzy sets. Firstly, combining dominance relation of graded rough sets with dominance relation in intuitionistic fuzzy ordered information systems, we [...] Read more.
From the perspective of the degrees of classification error, we proposed graded rough intuitionistic fuzzy sets as the extension of classic rough intuitionistic fuzzy sets. Firstly, combining dominance relation of graded rough sets with dominance relation in intuitionistic fuzzy ordered information systems, we designed type-I dominance relation and type-II dominance relation. Type-I dominance relation reduces the errors caused by single theory and improves the precision of ordering. Type-II dominance relation decreases the limitation of ordering by single theory. After that, we proposed graded rough intuitionistic fuzzy sets based on type-I dominance relation and type-II dominance relation. Furthermore, from the viewpoint of multi-granulation, we further established multi-granulation graded rough intuitionistic fuzzy sets models based on type-I dominance relation and type-II dominance relation. Meanwhile, some properties of these models were discussed. Finally, the validity of these models was verified by an algorithm and some relative examples. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Four Operators of Rough Sets Generalized to Matroids and a Matroidal Method for Attribute Reduction
Symmetry 2018, 10(9), 418; https://doi.org/10.3390/sym10090418
Received: 8 August 2018 / Revised: 13 September 2018 / Accepted: 14 September 2018 / Published: 19 September 2018
Cited by 3 | PDF Full-text (780 KB) | HTML Full-text | XML Full-text
Abstract
Rough sets provide a useful tool for data preprocessing during data mining. However, many algorithms related to some problems in rough sets, such as attribute reduction, are greedy ones. Matroids propose a good platform for greedy algorithms. Therefore, it is important to study [...] Read more.
Rough sets provide a useful tool for data preprocessing during data mining. However, many algorithms related to some problems in rough sets, such as attribute reduction, are greedy ones. Matroids propose a good platform for greedy algorithms. Therefore, it is important to study the combination between rough sets and matroids. In this paper, we investigate rough sets and matroids through their operators, and provide a matroidal method for attribute reduction in information systems. Firstly, we generalize four operators of rough sets to four operators of matroids through the interior, closure, exterior and boundary axioms, respectively. Thus, there are four matroids induced by these four operators of rough sets. Then, we find that these four matroids are the same one, which implies the relationship about operators between rough sets and matroids. Secondly, a relationship about operations between matroids and rough sets is presented according to the induced matroid. Finally, the girth function of matroids is used to compute attribute reduction in information systems. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Open AccessArticle
Some Results on Multigranulation Neutrosophic Rough Sets on a Single Domain
Symmetry 2018, 10(9), 417; https://doi.org/10.3390/sym10090417
Received: 11 August 2018 / Revised: 10 September 2018 / Accepted: 13 September 2018 / Published: 19 September 2018
PDF Full-text (404 KB) | HTML Full-text | XML Full-text
Abstract
As a generalization of single value neutrosophic rough sets, the concept of multi-granulation neutrosophic rough sets was proposed by Bo et al., and some basic properties of the pessimistic (optimistic) multigranulation neutrosophic rough approximation operators were studied. However, they did not do a [...] Read more.
As a generalization of single value neutrosophic rough sets, the concept of multi-granulation neutrosophic rough sets was proposed by Bo et al., and some basic properties of the pessimistic (optimistic) multigranulation neutrosophic rough approximation operators were studied. However, they did not do a comprehensive study on the algebraic structure of the pessimistic (optimistic) multigranulation neutrosophic rough approximation operators. In the present paper, we will provide the lattice structure of the pessimistic multigranulation neutrosophic rough approximation operators. In particular, in the one-dimensional case, for special neutrosophic relations, the completely lattice isomorphic relationship between upper neutrosophic rough approximation operators and lower neutrosophic rough approximation operators is proved. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Fixed Points Results in Algebras of Split Quaternion and Octonion
Symmetry 2018, 10(9), 405; https://doi.org/10.3390/sym10090405
Received: 3 August 2018 / Revised: 11 September 2018 / Accepted: 14 September 2018 / Published: 17 September 2018
Cited by 1 | PDF Full-text (299 KB) | HTML Full-text | XML Full-text
Abstract
Fixed points of functions have applications in game theory, mathematics, physics, economics and computer science. The purpose of this article is to compute fixed points of a general quadratic polynomial in finite algebras of split quaternion and octonion over prime fields Zp [...] Read more.
Fixed points of functions have applications in game theory, mathematics, physics, economics and computer science. The purpose of this article is to compute fixed points of a general quadratic polynomial in finite algebras of split quaternion and octonion over prime fields Z p. Some characterizations of fixed points in terms of the coefficients of these polynomials are also given. Particularly, cardinalities of these fixed points have been determined depending upon the characteristics of the underlying field. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Open AccessArticle
Optimizing the High-Level Maintenance Planning Problem of the Electric Multiple Unit Train Using a Modified Particle Swarm Optimization Algorithm
Symmetry 2018, 10(8), 349; https://doi.org/10.3390/sym10080349
Received: 17 July 2018 / Revised: 6 August 2018 / Accepted: 17 August 2018 / Published: 19 August 2018
PDF Full-text (1623 KB) | HTML Full-text | XML Full-text
Abstract
Electric multiple unit (EMU) trains’ high-level maintenance planning is a discrete problem in mathematics. The high-level maintenance process of the EMU trains consumes plenty of time. When the process is undertaken during peak periods of the passenger flow, the transportation demand may not [...] Read more.
Electric multiple unit (EMU) trains’ high-level maintenance planning is a discrete problem in mathematics. The high-level maintenance process of the EMU trains consumes plenty of time. When the process is undertaken during peak periods of the passenger flow, the transportation demand may not be fully satisfied due to the insufficient supply of trains. In contrast, if the process is undergone in advance, extra costs will be incurred. Based on the practical requirements of high-level maintenance, a 0–1 programming model is proposed. To simplify the description of the model, candidate sets of delivery dates, i.e., time windows, are generated according to the historical data and maintenance regulations. The constraints of the model include maintenance regulations, the passenger transportation demand, and capacities of workshop. The objective function is to minimize the mileage losses of all EMU trains. Moreover, a modified particle swarm algorithm is developed for solving the problem. Finally, a real-world case study of Shanghai Railway is conducted to demonstrate the proposed method. Computational results indicate that the (approximate) optimal solution can be obtained successfully by our method and the proposed method significantly reduces the solution time to 500 s. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Figures

Figure 1

Open AccessArticle
Binary Icosahedral Group and 600-Cell
Symmetry 2018, 10(8), 326; https://doi.org/10.3390/sym10080326
Received: 10 July 2018 / Revised: 24 July 2018 / Accepted: 26 July 2018 / Published: 7 August 2018
PDF Full-text (268 KB) | HTML Full-text | XML Full-text
Abstract
In this article, we have an explicit description of the binary isosahedral group as a 600-cell. We introduce a method to construct binary polyhedral groups as a subset of quaternions H via spin map of SO(3). In addition, [...] Read more.
In this article, we have an explicit description of the binary isosahedral group as a 600-cell. We introduce a method to construct binary polyhedral groups as a subset of quaternions H via spin map of SO(3). In addition, we show that the binary icosahedral group in H is the set of vertices of a 600-cell by applying the Coxeter–Dynkin diagram of H4. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Open AccessArticle
Enumeration of Strongly Regular Graphs on up to 50 Vertices Having S3 as an Automorphism Group
Symmetry 2018, 10(6), 212; https://doi.org/10.3390/sym10060212
Received: 17 May 2018 / Revised: 4 June 2018 / Accepted: 8 June 2018 / Published: 11 June 2018
PDF Full-text (287 KB) | HTML Full-text | XML Full-text
Abstract
One of the main problems in the theory of strongly regular graphs (SRGs) is constructing and classifying SRGs with given parameters. Strongly regular graphs with parameters (37,18,8,9), (41,20,9, [...] Read more.
One of the main problems in the theory of strongly regular graphs (SRGs) is constructing and classifying SRGs with given parameters. Strongly regular graphs with parameters (37,18,8,9), (41,20,9,10), (45,22,10,11), (49,24,11,12), (49,18,7,6) and (50,21,8,9) are the only strongly regular graphs on up to 50 vertices that still have to be classified. In this paper, we give the enumeration of SRGs with these parameters having S3 as an automorphism group. The construction of SRGs in this paper is a step in the classification of SRGs on up to 50 vertices. Full article
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top