Skip to Content
You are currently on the new version of our website. Access the old version .

221 Results Found

  • Feature Paper
  • Article
  • Open Access
7 Citations
3,389 Views
20 Pages

Extending Undirected Graph Techniques to Directed Graphs via Category Theory

  • Sebastian Pardo-Guerra,
  • Vivek Kurien George,
  • Vikash Morar,
  • Joshua Roldan and
  • Gabriel Alex Silva

29 April 2024

We use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a c...

  • Article
  • Open Access
3 Citations
1,628 Views
12 Pages

6 March 2025

The problem of finding a maximum acyclic matching in a simple undirected graph is known to be NP-complete. In this paper, we present new results; we show that a maximum acyclic matching in a given undirected graph (with n vertices and m edges) can be...

  • Article
  • Open Access
1,946 Views
13 Pages

24 September 2022

We use the finite dimensional monotonicity methods in order to investigate problems connected with the discrete sx,·-Laplacian on simple, connected, undirected, weighted, and finite graphs with nonlinearities given in a non-potential form. Pos...

(This article belongs to the Section Complexity)
  • Article
  • Open Access
9 Citations
6,874 Views
22 Pages

Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs

  • Mao Luo,
  • Huigang Qin,
  • Xinyun Wu,
  • Caiquan Xiong and ,
  • Dahai Xia and
  • Yuanzhi Ke
  • + 1 author+ 0 author

28 March 2024

This paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes. By identifying the...

(This article belongs to the Special Issue Advances in Graph Theory: Algorithms and Applications)
  • Feature Paper
  • Article
  • Open Access
3 Citations
2,744 Views
16 Pages

On the Graph Isomorphism Completeness of Directed and Multidirected Graphs

  • Sebastian Pardo-Guerra,
  • Vivek Kurien George and
  • Gabriel A. Silva

11 January 2025

The category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
2 Citations
4,779 Views
10 Pages

9 October 2017

This article aims to provide new results about the intraday degree sequence distribution considering phone call network graph evolution in time. More specifically, it tackles the following problem. Given a large amount of landline phone call data rec...

  • Article
  • Open Access
369 Views
17 Pages

16 July 2026

Graph alliances have wide-ranging applications, including community detection in social networks, the identification of resilient subnetworks in communication systems, and the modeling of stable coalitions in competitive environments. Among the main...

(This article belongs to the Special Issue Advances in Graph Theory, Combinatorics, and Applications)
  • Article
  • Open Access
16 Citations
6,149 Views
19 Pages

A Graph Skeleton Transformer Network for Action Recognition

  • Yujian Jiang,
  • Zhaoneng Sun,
  • Saisai Yu,
  • Shuang Wang and
  • Yang Song

28 July 2022

Skeleton-based action recognition is a research hotspot in the field of computer vision. Currently, the mainstream method is based on Graph Convolutional Networks (GCNs). Although there are many advantages of GCNs, GCNs mainly rely on graph topologie...

(This article belongs to the Special Issue Computer Vision, Pattern Recognition, Machine Learning, and Symmetry)
  • Article
  • Open Access
8 Citations
4,022 Views
15 Pages

A Generalization of the Importance of Vertices for an Undirected Weighted Graph

  • Ronald Manríquez,
  • Camilo Guerrero-Nancuante,
  • Felipe Martínez and
  • Carla Taramasco

19 May 2021

Establishing a node importance ranking is a problem that has attracted the attention of many researchers in recent decades. For unweighted networks where the edges do not have any attached weight, many proposals have been presented, considering local...

(This article belongs to the Special Issue Symmetry in Engineering Sciences Ⅲ)
  • Article
  • Open Access
39 Citations
5,172 Views
19 Pages

Group Target Tracking Based on MS-MeMBer Filters

  • Zhiguo Zhang,
  • Jinping Sun,
  • Huiyu Zhou and
  • Congan Xu

14 May 2021

This paper presents a new group target tracking method based on the standard multi-sensor multi-target multi-Bernoulli (MS-MeMBer) filter. In the prediction step, the group structure is used to constrain the movement of the constituent members within...

(This article belongs to the Special Issue Radar Signal Processing for Target Tracking)
  • Article
  • Open Access
6 Citations
2,913 Views
15 Pages

Hill Climbing-Based Efficient Model for Link Prediction in Undirected Graphs

  • Haji Gul,
  • Feras Al-Obeidat,
  • Adnan Amin,
  • Fernando Moreira and
  • Kaizhu Huang

15 November 2022

Link prediction is a key problem in the field of undirected graph, and it can be used in a variety of contexts, including information retrieval and market analysis. By “undirected graphs”, we mean undirected complex networks in this study...

(This article belongs to the Special Issue Modeling and Analysis of Complex Networks)
  • Article
  • Open Access
8 Citations
3,166 Views
17 Pages

8 February 2021

The micro-canonical, canonical, and grand canonical ensembles of walks defined in finite connected undirected graphs are considered in the thermodynamic limit of infinite walk length. As infinitely long paths are extremely sensitive to structural irr...

(This article belongs to the Special Issue Entropic Forces in Complex Systems)
  • Article
  • Open Access
7 Citations
6,624 Views
24 Pages

27 February 2019

Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in O ( n + m ) time for a graph with n vertices and m edges. We consider the dynamic DFS problem, that is, to maintain a DFS tree of an undirected graph G...

(This article belongs to the Special Issue Efficient Data Structures)
  • Article
  • Open Access
2,107 Views
20 Pages

8 December 2023

This paper investigates the capability of undirected graphs (UGs) to represent a set of Conditional Independence (CI) statements derived from a given probability distribution of a random vector. While it is established that certain axioms can govern...

(This article belongs to the Section Mathematical Analysis)
  • Article
  • Open Access
2 Citations
4,919 Views
28 Pages

1 November 2023

Two linear algebra problems implore a solution to them, creating the themes pursued in this paper. The first problem interfaces with graph theory via binary 0-1 adjacency matrices and their Laplacian counterparts. More contemporary spatial statistics...

  • Article
  • Open Access
1 Citations
3,086 Views
18 Pages

15 June 2023

Canonical ensembles of walks in a finite connected graph assign the properly normalized probability distributions to all nodes, subgraphs, and nodal subsets of the graph at all time and connectivity scales of the diffusion process. The probabilistic...

(This article belongs to the Special Issue Trends in Computational and Cognitive Engineering)
  • Article
  • Open Access
7 Citations
3,325 Views
17 Pages

11 August 2023

One of the most important problems in complex networks is the location of nodes that are essential or play a main role in the network. Nodes with main local roles are the centers of real communities. Communities are sets of nodes of complex networks...

(This article belongs to the Special Issue Signal and Information Processing in Networks)
  • Article
  • Open Access
268 Views
14 Pages

Induced matchings are a fundamental graph-theoretic concept with applications in secure communication, network flow, and very-large-scale integration. An induced matching in a graph is a set of pairwise non-adjacent edges such that no edge of the gra...

  • Article
  • Open Access
7 Citations
3,401 Views
13 Pages

Identifying the Shortest Path of a Semidirected Graph and Its Application

  • Rakhi Das,
  • Laxminarayan Sahoo,
  • Sovan Samanta,
  • Vladimir Simic and
  • Tapan Senapati

17 December 2022

The basic goal of this research is to find the shortest path of a semidirected graph and apply it to the road network system. In the field of graph theory, networks are described as directed graphs, undirected graphs, or a combination of both. Howeve...

  • Article
  • Open Access
3 Citations
3,020 Views
9 Pages

D-Magic Oriented Graphs

  • Alison Marr and
  • Rinovia Simanjuntak

27 November 2021

In this paper, we define D-magic labelings for oriented graphs where D is a distance set. In particular, we label the vertices of the graph with distinct integers {1,2,…,|V(G)|} in such a way that the sum of all the vertex labels that are a di...

(This article belongs to the Special Issue Graph Labelings and Their Applications)
  • Article
  • Open Access
3 Citations
2,832 Views
27 Pages

28 December 2022

Graph dynamics for a node-labeled graph is a set of updating rules describing how the labels of each node in the graph change in time as a function of the global set of labels. The underpopulation rule is graph dynamics derived by simplifying the set...

(This article belongs to the Special Issue Feature Papers in AppliedMath)
  • Article
  • Open Access
508 Views
32 Pages

Data-Driven Graph-Based Methods for In-Port AIS Vessel Trajectory Reconstruction

  • Evangelia Zaou,
  • Neofytos Dimitriou and
  • Ognjen Arandjelović

18 August 2026

AIS trajectories in and around ports are often incomplete because of transmission interruptions, reception failures, and infrastructure outages. In this paper, we investigate whether the Data-driven AIS Trajectory Interpolation method (DAISTIN), whic...

(This article belongs to the Special Issue Graph and Hypergraph Algorithms and Applications)
  • Article
  • Open Access
4 Citations
2,277 Views
12 Pages

Three Representation Types for Systems of Forms and Linear Maps

  • Abdullah Alazemi,
  • Milica Anđelić,
  • Carlos M. da Fonseca,
  • Vyacheslav Futorny and
  • Vladimir V. Sergeichuk

24 February 2021

We consider systems of bilinear forms and linear maps as representations of a graph with undirected and directed edges. Its vertices represent vector spaces; its undirected and directed edges represent bilinear forms and linear maps, respectively. We...

(This article belongs to the Section A: Algebra and Logic)
  • Article
  • Open Access
18 Citations
6,068 Views
16 Pages

Variability and Reproducibility of Directed and Undirected Functional MRI Connectomes in the Human Brain

  • Allegra Conti,
  • Andrea Duggento,
  • Maria Guerrisi,
  • Luca Passamonti and ,
  • Iole Indovina and
  • Nicola Toschi
  • + 1 author+ 0 author

6 July 2019

A growing number of studies are focusing on methods to estimate and analyze the functional connectome of the human brain. Graph theoretical measures are commonly employed to interpret and synthesize complex network-related information. While resting...

(This article belongs to the Special Issue Information Dynamics in Brain and Physiological Networks)
  • Review
  • Open Access
25 Citations
11,631 Views
47 Pages

Graph-Based Modeling in Shop Scheduling Problems: Review and Extensions

  • Jacqueline Otala,
  • Alden Minard,
  • Golshan Madraki and
  • Seyedamirabbas Mousavian

21 May 2021

Graphs are powerful tools to model manufacturing systems and scheduling problems. The complexity of these systems and their scheduling problems has been substantially increased by the ongoing technological development. Thus, it is essential to genera...

(This article belongs to the Section Mechanical Engineering)
  • Article
  • Open Access
2 Citations
2,174 Views
14 Pages

Generalized Randić Estrada Indices of Graphs

  • Eber Lenes,
  • Exequiel Mallea-Zepeda,
  • Luis Medina and
  • Jonnathan Rodríguez

14 August 2022

Let G be a simple undirected graph on n vertices. V. Nikiforov studied hybrids of AG and DG and defined the matrix AαG for every real α∈[0,1] as AαG=αDG+(1−α)AG. In this paper, we define the generalized Randi&...

(This article belongs to the Special Issue Advances in Discrete Applied Mathematics and Graph Theory, 2nd Edition)
  • Article
  • Open Access
1 Citations
2,304 Views
20 Pages

2 September 2024

The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of chordal multi-r...

(This article belongs to the Special Issue Symmetry in Combinatorial Structures)
  • Article
  • Open Access
2 Citations
2,389 Views
15 Pages

11 October 2021

Oblivious routing is a static algorithm for routing arbitrary user demands with the property that the competitive ratio, the proportion of the maximum congestion to the best possible congestion, is minimal. Oblivious routing turned out surprisingly e...

(This article belongs to the Section Electrical, Electronics and Communications Engineering)
  • Article
  • Open Access
5 Citations
4,230 Views
5 Pages

A Note on Graphs with Prescribed Orbit Structure

  • Abbe Mowshowitz,
  • Matthias Dehmer and
  • Frank Emmert-Streib

15 November 2019

This paper presents a proof of the existence of connected, undirected graphs with prescribed orbit structure, giving an explicit construction procedure for these graphs. Trees with prescribed orbit structure are also investigated.

(This article belongs to the Section Multidisciplinary Applications)
  • Article
  • Open Access
9 Citations
3,680 Views
14 Pages

In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy gr...

(This article belongs to the Special Issue Algebra and Its Applications)
  • Article
  • Open Access
3 Citations
3,305 Views
17 Pages

Mental Map-Preserving Visualization through a Genetic Algorithm

  • Mojiborrahman Dehvari,
  • Chuan-Kai Yang and
  • Enrico Armando

11 May 2021

The video game industry has evolved significantly, with different genres becoming popular over time, but how to visualize such information by curating data into a form that makes it easier to identify and understand the trends is quite an interesting...

(This article belongs to the Section Computing and Artificial Intelligence)
  • Feature Paper
  • Article
  • Open Access
547 Views
11 Pages

24 April 2026

This paper addresses the problem of interpolating missing spatial data at the vertices of a connected undirected simple graph. We show that, by exploiting the eigenbasis of the graph Laplacian, all missing values can be reconstructed even from a sing...

(This article belongs to the Special Issue Graph Theory and Applications, 3rd Edition)
  • Article
  • Open Access
15 Citations
6,054 Views
17 Pages

26 March 2019

We consider the problem of measuring the similarity between two graphs using continuous-time quantum walks and comparing their time-evolution by means of the quantum Jensen-Shannon divergence. Contrary to previous works that focused solely on undirec...

(This article belongs to the Special Issue Quantum Walks and Related Issues)
  • Article
  • Open Access
1 Citations
2,266 Views
21 Pages

19 December 2023

In this paper, we introduce the concepts of Harary Laplacian-energy-like for a simple undirected and connected graph G with order n. We also establish novel matrix results in this regard. Furthermore, by employing matrix order reduction techniques, w...

(This article belongs to the Special Issue Discrete Mathematics, Graph Theory and Applications)
  • Article
  • Open Access
42 Citations
6,149 Views
10 Pages

Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph

  • Jia-Bao Liu,
  • Zohaib Zahid,
  • Ruby Nasir and
  • Waqas Nazeer

7 November 2018

Consider an undirected and connected graph G = ( V G , E G ) , where V G and E G represent the set of vertices and the set of edges respectively. The concept of edge version of metric dimension and doubly resolving sets is...

(This article belongs to the Special Issue Discrete Optimization: Theory, Algorithms, and Applications)
  • Article
  • Open Access
1,696 Views
16 Pages

31 January 2025

For an undirected graph G, a zero-sum flow is an assignment of nonzero integer weights to the edges such that each vertex has a zero-sum, namely the sum of all incident edge weights with each vertex is zero. This concept is an undirected analog of no...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
12 Citations
3,916 Views
8 Pages

Characterization of Graphs Associated with Numerical Semigroups

  • Muhammad Ahsan Binyamin,
  • Hafiz Muhammad Afzal Siddiqui,
  • Nida Munawar Khan,
  • Adnan Aslam and
  • Yongsheng Rao

19 June 2019

Let Γ be a numerical semigroup. We associate an undirected graph G ( Γ ) with a numerical semigroup Γ with vertex set { v i : i ∈ N \ Γ } and edge set { v i v j ⇔ i + j ∈ &G...

  • Article
  • Open Access
1 Citations
2,392 Views
15 Pages

Classification of Genus Three Zero-Divisor Graphs

  • Thangaraj Asir,
  • Karuppiah Mano and
  • Turki Alsuraiheed

6 December 2023

In this paper, we consider the problem of classifying commutative rings according to the genus number of its associating zero-divisor graphs. The zero-divisor graph of R, where R is a commutative ring with nonzero identity, denoted by Γ(R), is...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
2 Citations
1,030 Views
13 Pages

On Dα-Spectrum of the Weakly Zero-Divisor Graph of ℤn

  • Amal S. Alali,
  • Mohd Rashid,
  • Asif Imtiyaz Ahmad Khan and
  • Muzibur Rahman Mozumder

24 July 2025

Let us consider the finite commutative ring R, whose unity is 1≠0. Its weakly zero-divisor graph, represented as WΓ(R), is a basic undirected graph with two distinct vertices, c1 and c2, that are adjacent if and only if there exist r∈&n...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
8 Citations
2,673 Views
17 Pages

Upper a-Graphical Topological Spaces with the COVID-19 Form and Its Diffusion

  • Faten H. Damag,
  • Amin Saif,
  • Adem Kiliçman,
  • Mouataz Billah Mesmouli and
  • Fozaiyah Alhubairah

23 January 2025

In this work, we use the monophonic eccentric open neighborhood system and the upper approximation neighborhood system to construct a new class of topologies in the theory of undirected simple graphs. We study some fundamental topological properties...

  • Article
  • Open Access
3 Citations
679 Views
29 Pages

New Approach for Closure Spaces on Graphs Based on Relations and Graph Ideals

  • Rehab Alharbi,
  • Salah El Deen Abbas,
  • Hossam Mahmoud Omar Khiamy and
  • Ismail Ibedou

29 November 2025

The main aim of this paper is to combine the connections between graph theory and rough set theory. We created graph ideal ASs by proposing the interior and closure operators, utilizing the concept of graph ideals. With the help of various graphical...

(This article belongs to the Section Geometry and Topology)
  • Article
  • Open Access
7 Citations
8,208 Views
34 Pages

Linking and Cutting Spanning Trees

  • Luís M. S. Russo,
  • Andreia Sofia Teixeira and
  • Alexandre P. Francisco

19 April 2018

We consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs,...

(This article belongs to the Special Issue Efficient Data Structures)
  • Article
  • Open Access
4 Citations
3,755 Views
17 Pages

30 August 2022

This article considers the problem of image segmentation based on its representation as an undirected weighted graph. Image segmentation is equivalent to partitioning a graph into communities. The image segment corresponds to each community. The grow...

(This article belongs to the Collection Feature Papers in Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
2,764 Views
16 Pages

Optimal Transport and Seismic Rays

  • Fabrizio Magrini and
  • Malcolm Sambridge

17 November 2023

We present a theoretical framework that links Fermat’s principle of least time to optimal transport theory via a cost function that enforces local transport. The proposed cost function captures the physical constraints inherent in wave propagat...

(This article belongs to the Special Issue Mathematical Modeling in Geophysics: Concepts and Practices)
  • Article
  • Open Access
1 Citations
1,978 Views
14 Pages

This paper investigates the periodic event-triggered asymmetric bipartite consensus problem of multi-agent systems (MASs) under structurally balanced undirected signed graphs. In order to reduce the consumption of communication resources and continuo...

(This article belongs to the Section Systems & Control Engineering)
  • Article
  • Open Access
4 Citations
3,303 Views
21 Pages

Einstein Model of a Graph to Characterize Protein Folded/Unfolded States

  • Steve Tyler,
  • Christophe Laforge,
  • Adrien Guzzo,
  • Adrien Nicolaï and ,
  • Gia G. Maisuradze and
  • Patrick Senet
  • + 1 author+ 0 author

16 September 2023

The folded structures of proteins can be accurately predicted by deep learning algorithms from their amino-acid sequences. By contrast, in spite of decades of research studies, the prediction of folding pathways and the unfolded and misfolded states...

(This article belongs to the Special Issue Protein Folding, towards the Comprehensive Understanding from Various Aspects)
  • Article
  • Open Access
1 Citations
2,183 Views
22 Pages

25 March 2023

This paper generalizes the structural Markov properties for undirected decomposable graphs to arbitrary ones. This helps us to exploit the conditional independence properties of joint prior laws to analyze and compare multiple graphical structures, w...

(This article belongs to the Special Issue Advances in Applied Probability and Statistical Inference)
  • Article
  • Open Access
9 Citations
4,456 Views
14 Pages

16 October 2020

In this work, we solve the problem of the coexistence of periodic orbits in homogeneous Boolean graph dynamical systems that are induced by a maxterm or a minterm (Boolean) function, with a direct underlying dependency graph. Specifically, we show th...

(This article belongs to the Special Issue Boolean Networks Models in Science and Engineering)
  • Article
  • Open Access
2 Citations
3,195 Views
21 Pages

A Time Correlation Based Clustering Method for a Design of a Transformable Product

  • Jinpu Zhang,
  • Guozhong Cao,
  • Qingjin Peng,
  • Runhua Tan and ,
  • Huangao Zhang and
  • Wei Liu
  • + 1 author+ 0 author

5 January 2020

A single-function product cannot meet various needs of different users when the product user or use environment changes. A transformable product with multiple functions can meet different needs of users. It is critical to determine product functions...

(This article belongs to the Section Mechanical Engineering)

of 5