- 2.1Impact Factor
- 4.5CiteScore
- 20 daysTime to First Decision
Graph Algorithms and Graph Labeling
This special issue belongs to the section “Combinatorial Optimization, Graph, and Network Algorithms“.
Special Issue Information
Dear Colleagues,
We invite you to submit your latest research in graph theory and experimental mathematics to this Special Issue, “Graph algorithms and graph labeling”. In applied mathematics, graphs are one of the powerful tools for understanding the objects to determine combinatorial properties. Graph invariants are investigated to map on real time applications in chemical, electrical, electronics, computer and telecommunication engineering. The labeling of temporal graphs (dynamic graphs) is challenging but they have a closer relationship with real-time applications. We are looking for new and innovative approaches of graph labeling, topological indices and metric dimension in coding theory, channel assignment, computer network, layouts of digital circuits, semantic web and social networks. Submissions are welcome to flourish awareness and publication of recent developments in the area of graph properties, methods and applications.
Dr. Ali Ahmad
Dr. Muhammad Ahsan Asim
Dr. Yilun Shang
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 250 words) can be sent to the Editorial Office for assessment.
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. Algorithms 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 1800 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
- complexity issues
- graph labeling and coloring
- graph combinatorics
- distance in graphs
- graph algorithms
- approximation algorithms
- enumerative algorithms
- number theory and computer security
- edge metric dimension
- topological indices
- mathematical chemistry
- molecular descriptors
- extremal graph theory
- algebraic graph theory
- resolving sets
- energy of fraph
- spectral graph theory
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.
Published Papers
Get Alerted
Add your email address to receive forthcoming issues of this journal.
Algorithms - ISSN 1999-4893