Recent Studies on Topological and Geometrical Properties of Discrete Structures

A special issue of Symmetry (ISSN 2073-8994). This special issue belongs to the section "Mathematics".

Deadline for manuscript submissions: closed (31 August 2022) | Viewed by 6826

Special Issue Editors


E-Mail Website
Guest Editor
Department of Mathematics and Statistics, Florida International University, Miami, FL, USA
Interests: Gromov’s hyperbolic spaces; graph polynomials; topological descriptors; discrete geometry; metric graphs

E-Mail Website
Guest Editor
Department of Economic Analysis and Finance, Universidad de Castilla-La Mancha, Ciudad Real, Spain
Interests: Gromov hyperbolic spaces, R-trees, geometric group theory, geometric topology, metric graphs, topological indices.

Special Issue Information

Dear Colleagues,

This Special Issue is devoted to original and significant contributions to topological and geometrical properties of discrete structures. The aim is to bring together research papers linking Discrete Mathematics and other areas of mathematics involving discrete structures and symmetry, as well as applications to other areas of science and technology. The issue covers topics in Discrete Mathematics and other areas including (but not limited to) discrete structures, graph theory, discrete geometry, polynomials, topological descriptors, parameters of graphs, and discrete optimization. Contributions presented to the issue can be original research papers, short notes, or surveys.

Dr. Walter Carballosa
Dr. Álvaro Martínez Pérez
Guest Editors

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 submissions that pass pre-check are 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 2400 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

  • discrete structures
  • graph polynomials
  • crossing numbers
  • independent sets
  • dominating sets
  • matchings
  • hyperbolic graphs
  • alliances
  • packing problem
  • metric dimension
  • topological indices
  • discretization
  • discrete geometry
  • metric graphs
  • graph theory
  • hypergraphs
  • discrete optimization
  • graph parameters

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (3 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

13 pages, 316 KiB  
Article
k-Zero-Divisor and Ideal-Based k-Zero-Divisor Hypergraphs of Some Commutative Rings
by Pinkaew Siriwong and Ratinan Boonklurb
Symmetry 2021, 13(11), 1980; https://doi.org/10.3390/sym13111980 - 20 Oct 2021
Cited by 1 | Viewed by 1309
Abstract
Let R be a commutative ring with nonzero identity and k2 be a fixed integer. The k-zero-divisor hypergraph Hk(R) of R consists of the vertex set Z(R,k), the set of [...] Read more.
Let R be a commutative ring with nonzero identity and k2 be a fixed integer. The k-zero-divisor hypergraph Hk(R) of R consists of the vertex set Z(R,k), the set of all k-zero-divisors of R, and the hyperedges of the form {a1,a2,a3,,ak}, where a1,a2,a3,,ak are k distinct elements in Z(R,k), which means (i) a1a2a3ak=0 and (ii) the products of all elements of any (k1) subsets of {a1,a2,a3,,ak} are nonzero. This paper provides two commutative rings so that one of them induces a family of complete k-zero-divisor hypergraphs, while another induces a family of k-partite σ-zero-divisor hypergraphs, which illustrates unbalanced or asymmetric structure. Moreover, the diameter and the minimum length of all cycles or girth of the family of k-partite σ-zero-divisor hypergraphs are determined. In addition to a k-zero-divisor hypergraph, we provide the definition of an ideal-based k-zero-divisor hypergraph and some basic results on these hypergraphs concerning a complete k-partite k-uniform hypergraph, a complete k-uniform hypergraph, and a clique. Full article
15 pages, 516 KiB  
Article
Hamiltonicity of Token Graphs of Some Join Graphs
by Luis Enrique Adame, Luis Manuel Rivera and Ana Laura Trujillo-Negrete
Symmetry 2021, 13(6), 1076; https://doi.org/10.3390/sym13061076 - 16 Jun 2021
Cited by 3 | Viewed by 2608
Abstract
Let G be a simple graph of order n with vertex set V(G) and edge set E(G), and let k be an integer such that 1kn1. The k-token [...] Read more.
Let G be a simple graph of order n with vertex set V(G) and edge set E(G), and let k be an integer such that 1kn1. The k-token graph G{k} of G is the graph whose vertices are the k-subsets of V(G), where two vertices A and B are adjacent in G{k} whenever their symmetric difference AB, defined as (AB)(BA), is a pair {a,b} of adjacent vertices in G. In this paper we study the Hamiltonicity of the k-token graphs of some join graphs. We provide an infinite family of graphs, containing Hamiltonian and non-Hamiltonian graphs, for which their k-token graphs are Hamiltonian. Our result provides, to our knowledge, the first family of non-Hamiltonian graphs for which it is proven the Hamiltonicity of their k-token graphs, for any 2<k<n2. Full article
Show Figures

Figure 1

13 pages, 541 KiB  
Article
An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane
by Aurora Espinoza-Valdez, Jesús Leaños, Christophe Ndjatchi and Luis Manuel Ríos-Castro
Symmetry 2021, 13(6), 1050; https://doi.org/10.3390/sym13061050 - 10 Jun 2021
Cited by 2 | Viewed by 1918
Abstract
Let P be a set of n3 points in general position in the plane. The edge disjointness graph D(P) of P is the graph whose vertices are the n2 closed straight line segments with endpoints in P [...] Read more.
Let P be a set of n3 points in general position in the plane. The edge disjointness graph D(P) of P is the graph whose vertices are the n2 closed straight line segments with endpoints in P, two of which are adjacent in D(P) if and only if they are disjoint. In this paper we show that the connectivity of D(P) is at most 7n218+Θ(n), and that this upper bound is asymptotically tight. The proof is based on the analysis of the connectivity of D(Qn), where Qn denotes an n-point set that is almost 3-symmetric. Full article
Show Figures

Figure 1

Back to TopTop