Graph Theory and Applications, 2nd Edition

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Mathematics and Computer Science".

Deadline for manuscript submissions: 31 May 2024 | Viewed by 1998

Special Issue Editor


E-Mail Website
Guest Editor
School of Mathematical Sciences, Rochester Institute of Technology, Rochester, NY, USA
Interests: graph theory; combinatorics; social networks; functional connectivity of the brain; mathematical modeling
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

As we prepare for the second volume of our Special Issue, we invite you to partake in this exciting endeavor. Building upon the success of the inaugural edition, we are enthusiastic to continue exploring the realms of graph theory and its multifaceted applications.

In this upcoming Special Issue, we extend a warm invitation to you to submit papers delving into graph theory's intersections with biology, computer science, complex and social networks, engineering, and various other domains. While we wholeheartedly embrace contributions that showcase real-world applications, we also value and will consider papers that possess a theoretical foundation yet offer the promise of potential applications.

We eagerly anticipate your valuable contributions as we embark on this new volume.

Prof. Dr. Darren Narayan
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 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. Mathematics is an international peer-reviewed open access semimonthly 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 2600 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

  • graph theory
  • biology
  • computer science
  • complex and social networks
  • engineering

Related Special Issue

Published Papers (2 papers)

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

Research

17 pages, 912 KiB  
Article
Semi-Local Integration Measure for Directed Graphs
by Tajana Ban Kirigin and Sanda Bujačić Babić
Mathematics 2024, 12(7), 1087; https://doi.org/10.3390/math12071087 - 04 Apr 2024
Viewed by 450
Abstract
Directed and weighted graphs can be used for many real-world applications to model and analyse the quality and structure of communication within the system, the distribution and flow of information, and various resources, dependencies, resilience, etc. On social media platforms, for example, highly [...] Read more.
Directed and weighted graphs can be used for many real-world applications to model and analyse the quality and structure of communication within the system, the distribution and flow of information, and various resources, dependencies, resilience, etc. On social media platforms, for example, highly networked members, so-called influencers, disseminate information, opinions and trends to their followers, who in turn increase the popularity of the influencers through likes and comments. Both types of interaction have a major influence on discussions and activities in the social network. To identify the nodes with the highest integration and interconnectivity within the neighbourhood subnetwork, we introduce the Directed Semi-Local Integration (DSLI) centrality measure for directed and weighted graphs. This centrality measure evaluates the integration of nodes assessed by the presence of connection, the strength of links, the organisation and optimisation of inbound and outbound interconnectivity, and the redundancy in the local subnetwork, and provides a stronger differentiation of the importance of nodes than standard centrality measures. Thus, DSLI has the potential to be used for analysing the degree of integration for the uptake and dissemination of resources in complex networks in many different contexts. Full article
(This article belongs to the Special Issue Graph Theory and Applications, 2nd Edition)
Show Figures

Figure 1

18 pages, 628 KiB  
Article
An Effective Fuzzy Clustering of Crime Reports Embedded by a Universal Sentence Encoder Model
by Aparna Pramanik, Asit Kumar Das, Danilo Pelusi and Janmenjoy Nayak
Mathematics 2023, 11(3), 611; https://doi.org/10.3390/math11030611 - 26 Jan 2023
Cited by 2 | Viewed by 1208
Abstract
Crime reports clustering is crucial for identifying and preventing criminal activities that frequently happened in society. In the proposed work, named entities in a report are recognized to extract the crime-related phrases and subsequently, the phrases are preprocessed by applying stopword removal and [...] Read more.
Crime reports clustering is crucial for identifying and preventing criminal activities that frequently happened in society. In the proposed work, named entities in a report are recognized to extract the crime-related phrases and subsequently, the phrases are preprocessed by applying stopword removal and lemmatization operations. Next, the module of the universal encoder model, called the transformer, is applied to extract phrases of the report to get a sentence embedding for each associated sentence, aggregation of which finally provides the vector representation of that report. An innovative and efficient graph-based clustering algorithm consisting of splitting and merging operations has been proposed to get the cluster of crime reports. The proposed clustering algorithm generates overlapping clusters, which indicates the existence of reports of multiple crime types. The fuzzy theory has been used to provide a score to the report for expressing its membership into different clusters, and accordingly, the reports are labelled by multiple categories. The efficiency of the proposed method has been assessed by taking into account different datasets and comparing them with other state-of-the-art approaches with the help of various performance measure metrics. Full article
(This article belongs to the Special Issue Graph Theory and Applications, 2nd Edition)
Show Figures

Figure 1

Back to TopTop