Symmetry and Graph Theory, 2nd Edition

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

Deadline for manuscript submissions: 31 December 2024 | Viewed by 787

Special Issue Editors


E-Mail Website
Guest Editor
Departamento de Matemáticas, Universidad de Córdoba, Campus de Rabanales, 14071 Córdoba, Spain
Interests: graph theory; discrete mathematics
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Departament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, 43007 Tarragona, Spain
Interests: graph theory; applied mathematics; discrete mathematics; computer science
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

We warmly invite you to submit original research papers or reviews to this Special Issue entitled “”Symmetry and Graph Theory”, which aims to focus on recent developments in graph theoretical research, particularly in relation to symmetry. Graph theory has widespread applications across various research domains, making this Special Issue a platform for valuable contributions to this significant field. This Special Issue encompasses a range of topics in graph theory, such as metric dimension, topological indices, coloring, domination, independence, Ramsey numbers, and polynomials in graphs, among others. We welcome your valuable insights regarding any of these areas.

Dr. Abel Cabrera Martínez
Dr. Alejandro Estrada-Moreno
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

  • metric dimension of graphs
  • topological indices
  • graph coloring
  • domination in graphs
  • Ramsey number
  • polynomials in graphs

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.

Related Special Issue

Published Papers (1 paper)

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

Research

20 pages, 415 KiB  
Article
Efficient Graph Algorithms in Securing Communication Networks
by Syed Ahtsham Ul Haq Bokhary, Athar Kharal, Fathia M. Al Samman, Mhassen. E. E. Dalam and Ameni Gargouri
Symmetry 2024, 16(10), 1269; https://doi.org/10.3390/sym16101269 - 26 Sep 2024
Viewed by 615
Abstract
This paper presents three novel encryption and decryption schemes based on graph theory that aim to improve security and error resistance in communication networks. The novelty of this work lies in the application of complete bipartite graphs in two of the schemes and [...] Read more.
This paper presents three novel encryption and decryption schemes based on graph theory that aim to improve security and error resistance in communication networks. The novelty of this work lies in the application of complete bipartite graphs in two of the schemes and the Cartesian product of graphs in the third, representing a unique approach to cryptographic algorithm development. Unlike traditional cryptographic methods, these graph-based schemes use structural properties of graphs to achieve robust encryption, providing greater resistance to attacks and corruption. Each scheme is illustrated with detailed examples that show how the algorithms can be successfully implemented. The algorithms are written in standard mathematical notation, making them adaptable for machine implementation and scalable for real-world use. The schemes are also rigorously analyzed and compared in terms of their temporal and spatial complexities, using Big O notation. This comprehensive evaluation focuses on their effectiveness, providing valuable insights into their potential for secure communication in modern networks. Full article
(This article belongs to the Special Issue Symmetry and Graph Theory, 2nd Edition)
Show Figures

Figure 1

Back to TopTop