Skip to Content

483 Results Found

  • Article
  • Open Access
1 Citations
2,559 Views
13 Pages

On Connected Subsets of a Convergence Space

  • Bryan Gerardo Castro Herrejón and
  • Frédéric Mynard

27 August 2025

Though a convergence space is connected if and only if its topological modification is connected, connected subsets of a convergence space differ from those of its topological modification. We explore which subsets exhibit connectedness for the conve...

  • Article
  • Open Access
1 Citations
679 Views
13 Pages

The g-Component Edge Connectivity of Graphs

  • He Li,
  • Jinyu Zou and
  • Shumin Zhang

12 May 2026

Connectivity is a classic measure that evaluates the fault tolerance of multiprocessor systems when processor failures occur. To better evaluate the reliability of multiprocessor systems, researchers have proposed many indicators based on connectivit...

  • Article
  • Open Access
1 Citations
3,286 Views
14 Pages

New Computation of Resolving Connected Dominating Sets in Weighted Networks

  • Adriana Dapena,
  • Daniel Iglesia,
  • Francisco J. Vazquez-Araujo and
  • Paula M. Castro

29 November 2019

In this paper we focus on the issue related to finding the resolving connected dominating sets (RCDSs) of a graph, denoted by G. The connected dominating set (CDS) is a connected subset of vertices of G selected to guarantee that all vertices in the...

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

A Study on Fuzzy Resolving Domination Sets and Their Application in Network Theory

  • Manimozhi Vasuki,
  • Ramachandramoorthi Shanmugapriya,
  • Miroslav Mahdal and
  • Robert Cep

7 January 2023

Consider a simple connected fuzzy graph (FG) G and consider an ordered fuzzy subset H = {(u1, σ(u1)), (u2, σ(u2)), …(uk, σ(uk))}, |H| ≥ 2 of a fuzzy graph; then, the representation of σ − H is an ordered k-tupl...

  • Article
  • Open Access
25 Citations
7,003 Views
11 Pages

A Deep Learning Model for Data-Driven Discovery of Functional Connectivity

  • Usman Mahmood,
  • Zening Fu,
  • Vince D. Calhoun and
  • Sergey Plis

26 February 2021

Functional connectivity (FC) studies have demonstrated the overarching value of studying the brain and its disorders through the undirected weighted graph of functional magnetic resonance imaging (fMRI) correlation matrix. However, most of the work w...

(This article belongs to the Special Issue Machine Learning in Healthcare and Biomedical Application)
  • Article
  • Open Access
14 Citations
4,604 Views
24 Pages

3 December 2023

This work addresses the wind farm (WF) optimization layout considering several substations. It is given a set of wind turbines jointly with a set of substations, and the goal is to obtain the optimal design to minimize the infrastructure cost and the...

(This article belongs to the Special Issue 10th Anniversary of Computation—Computational Engineering)
  • Article
  • Open Access
3 Citations
2,660 Views
13 Pages

An Ideal-Based Dot Total Graph of a Commutative Ring

  • Mohammad Ashraf,
  • Jaber H. Asalool,
  • Abdulaziz M. Alanazi and
  • Ahmed Alamer

29 November 2021

In this paper, we introduce and investigate an ideal-based dot total graph of commutative ring R with nonzero unity. We show that this graph is connected and has a small diameter of at most two. Furthermore, its vertex set is divided into three disjo...

(This article belongs to the Special Issue Algebraic Structures and Graph Theory)
  • Article
  • Open Access
27 Citations
3,390 Views
13 Pages

26 July 2021

This year, we introduced the concept of infra soft topology as a new generalization of soft topology. To complete our analysis of this space, we devote this paper to presenting the concepts of infra soft connected and infra soft locally connected spa...

(This article belongs to the Special Issue Fuzzy Topology)
  • Brief Report
  • Open Access
4 Citations
2,597 Views
9 Pages

We consider a general metric Steiner problem, which involves finding a set S with the minimal length, such that S∪A is connected, where A is a given compact subset of a given complete metric space X; a solution is called the Steiner tree. Paolini...

(This article belongs to the Topic Evolutionary Differential Equations, Dynamic Systems, Computation and Optimization)
  • Article
  • Open Access
5 Citations
4,246 Views
8 Pages

Commuting Graphs, C(G, X) in Symmetric Groups Sym(n) and Its Connectivity

  • Athirah Nawawi,
  • Sharifah Kartini Said Husain and
  • Muhammad Rezal Kamel Ariffin

17 September 2019

A commuting graph is a graph denoted by C ( G , X ) where G is any group and X, a subset of a group G, is a set of vertices for C ( G , X ) . Two distinct vertices, x , y ∈ X , will be connected by an edge if the commutativ...

  • Article
  • Open Access
2,086 Views
25 Pages

Phenotypic Timeline Kinetics, Integrative Networks, and Performance of T- and B-Cell Subsets Associated with Distinct Clinical Outcome of Severe COVID-19 Patients

  • Gabriela de Oliveira,
  • Ismael Artur Costa-Rocha,
  • Nani Oliveira-Carvalho,
  • Tâmilla Mayane Alves Fidelis dos Santos and ,
  • Ana Carolina Campi-Azevedo,
  • Vanessa Peruhype-Magalhães,
  • Vitor Hugo Simões Miranda,
  • Roberta Oliveira Prado,
  • Agnes Antônia Sampaio Pereira and
  • Olindo Assis Martins-Filho
  • + 16 authors+ 11 authors

The present study aimed to evaluate the kinetics of the phenotypic profile and integrative networks of T/B-cells in severe COVID-19 patients, categorized according to disease outcome, during the circulation of the B.1.1.28 and B.1.1.33 SARS-CoV-2 str...

(This article belongs to the Special Issue Immune Modulation to SARS-CoV-2 Vaccination and Infection)
  • Article
  • Open Access
3,117 Views
14 Pages

6 February 2025

For a connected graph G=(V,E), the dominating set in graph G is a subset of vertices F⊂V such that every vertex of V−F is adjacent to at least one vertex of F. The minimum cardinality of a dominating set of G, denoted by γ(G), is the...

  • Feature Paper
  • Article
  • Open Access
1 Citations
2,425 Views
12 Pages

An Information-Theoretic Bound on p-Values for Detecting Communities Shared between Weighted Labeled Graphs

  • Predrag Obradovic,
  • Vladimir Kovačević,
  • Xiqi Li and
  • Aleksandar Milosavljevic

21 September 2022

Extraction of subsets of highly connected nodes (“communities” or modules) is a standard step in the analysis of complex social and biological networks. We here consider the problem of finding a relatively small set of nodes in two labele...

(This article belongs to the Special Issue Information Theory in Computational Biology)
  • Article
  • Open Access
2 Citations
1,729 Views
10 Pages

Extremal k-Connected Graphs with Maximum Closeness

  • Fazal Hayat and
  • Daniele Ettore Otera

21 November 2024

Closeness is a measure that quantifies how quickly information can spread from a given node to all other nodes in the network, reflecting the efficiency of communication within the network by indicating how close a node is to all other nodes. For a g...

(This article belongs to the Special Issue Recent Developments in Graph Theory)
  • Article
  • Open Access
1 Citations
4,637 Views
18 Pages

5 March 2023

Over the years, connection or access to the Internet has shown a positive impact on users in their everyday activities, such as entertainment, online education, online business, and productivity increments in their communities. Unfortunately, rural c...

(This article belongs to the Special Issue Applied Optimization for Solving Real-World Problems)
  • Article
  • Open Access
3 Citations
2,891 Views
24 Pages

20 January 2022

We consider analytic functions in tubes Rn+iB⊂Cn with values in Banach space or Hilbert space. The base of the tube B will be a proper open connected subset of Rn, an open connected cone in Rn, an open convex cone in Rn, and a regular cone in Rn,...

(This article belongs to the Special Issue New Developments in Geometric Function Theory)
  • Article
  • Open Access
6 Citations
4,605 Views
18 Pages

Source-Space Brain Functional Connectivity Features in Electroencephalogram-Based Driver Fatigue Classification

  • Khanh Ha Nguyen,
  • Matthew Ebbatson,
  • Yvonne Tran,
  • Ashley Craig and ,
  • Hung Nguyen and
  • Rifai Chai
  • + 1 author+ 0 author

21 February 2023

This study examined the brain source space functional connectivity from the electroencephalogram (EEG) activity of 48 participants during a driving simulation experiment where they drove until fatigue developed. Source-space functional connectivity (...

(This article belongs to the Special Issue EEG Signal Processing for Sensing Technologies in Biomedical Engineering Applications)
  • Article
  • Open Access
1 Citations
3,088 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
1 Citations
1,461 Views
9 Pages

The paper considers queuing networks with prohibitions on transitions between network nodes that determine the protocol of their operation. In the graph of transient network intensities, a set of base vertices is allocated (proportional to the number...

(This article belongs to the Section Computational Engineering)
  • Review
  • Open Access
13 Citations
7,463 Views
21 Pages

24 December 2022

Studying how spatially discrete neuroanatomical regions across the brain interact is critical to advancing our understanding of the brain. Traditional neuroimaging techniques have led to many important discoveries about the nature of these interactio...

  • Article
  • Open Access
6 Citations
2,764 Views
20 Pages

27 June 2024

The exploiting of hybrid beamforming (HBF) in massive multiple-input multiple-output (MIMO) systems can enhance the system’s sum rate while reducing power consumption and hardware costs. However, designing an effective hybrid beamformer is chal...

(This article belongs to the Section Sensor Networks)
  • Article
  • Open Access
9 Citations
3,956 Views
8 Pages

The Differential on Graph Operator Q(G)

  • Ludwin A. Basilio,
  • Jair Castro Simon,
  • Jesús Leaños and
  • Omar Rosario Cayetano

6 May 2020

If G = ( V ( G ) , E ( G ) ) is a simple connected graph with the vertex set V ( G ) and the edge set E ( G ) , S is a subset of V ( G ) , and let B ( S ) be the set of neighbors of S in V ( G ) ∖ S . Then...

(This article belongs to the Special Issue Recent Advances in Discrete and Fractional Mathematics)
  • Article
  • Open Access
2 Citations
2,140 Views
14 Pages

29 October 2022

In this paper, we rigorously prove that unpredictable oscillations take place in the dynamics of Hopfield-type neural networks (HNNs) when synaptic connections, rates and external inputs are modulo periodic unpredictable. The synaptic connections, ra...

(This article belongs to the Special Issue Dynamical Systems, Differential Equations and Applications)
  • Review
  • Open Access
22 Citations
7,650 Views
17 Pages

The Use of Transarterial Approaches in Peripheral Arteriovenous Malformations (AVMs)

  • Aditya Khurana,
  • Patrick T. Hangge,
  • Hassan Albadawi,
  • M-Grace Knuttinen and ,
  • Sadeer J. Alzubaidi,
  • Sailendra G. Naidu,
  • J. Scott Kriegshauser,
  • Rahmi Oklu and
  • Brian W. Chong
  • + 4 authors+ 0 author

Arteriovenous malformations (AVMs) are a subset of congenital vascular malformations (CVMs). They comprise abnormal connections between arterial and venous circulation; treatment approaches are dependent on the angioarchitecture of the AVM, specifica...

(This article belongs to the Special Issue Image Guided Interventions and Emerging Technologies)
  • Article
  • Open Access
1 Citations
2,493 Views
20 Pages

Self-Attentive Subset Learning over a Set-Based Preference in Recommendation

  • Kunjia Liu,
  • Yifan Chen,
  • Jiuyang Tang,
  • Hongbin Huang and
  • Lihua Liu

28 January 2023

Recommender systems that learn user preference from item-level feedback (provided to individual items) have been extensively studied. Considering the risk of privacy exposure, learning from set-level feedback (provided to sets of items) has been demo...

(This article belongs to the Topic Data Science and Knowledge Discovery)
  • Article
  • Open Access
661 Views
20 Pages

21 July 2026

Statistical classification is traditionally studied using probability, decision theory, information theory, and optimisation. We show that classification problems also possess a natural combinatorial and topological structure. Given a binary classifi...

(This article belongs to the Special Issue 15th Anniversary of Axioms: Geometry and Topology)
  • Article
  • Open Access
7 Citations
3,834 Views
15 Pages

24 November 2020

The thalamus has been implicated in many cognitive processes, including long-term memory. More specifically, the anterior (AT) and mediodorsal (MD) thalamic nuclei have been associated with long-term memory. Despite extensive mapping of the anatomica...

(This article belongs to the Special Issue Effects of Individual Differences on Spatial Cognition)
  • Article
  • Open Access
2 Citations
1,656 Views
26 Pages

Detection of Critical Links for Improving Network Resilience

  • Nusin Akram,
  • Onur Ugurlu,
  • İlker Kocabaş and
  • Orhan Dagdeviren

Identifying and eliminating critical links in multi-hop networks is essential for enhancing overall network resilience. In this study, we propose a novel algorithm to detect links that significantly impact the pairwise connectivity of multi-hop netwo...

(This article belongs to the Section Networks)
  • Article
  • Open Access
4 Citations
2,877 Views
9 Pages

Remarks on Distance Based Topological Indices for ℓ-Apex Trees

  • Martin Knor,
  • Muhammad Imran,
  • Muhammad Kamran Jamil and
  • Riste Škrekovski

12 May 2020

A graph G is called an ℓ-apex tree if there exist a vertex subset A ⊂ V ( G ) with cardinality ℓ such that G − A is a tree and there is no other subset of smaller cardinality with this property. In the paper, we investigate...

(This article belongs to the Special Issue Analytical and Computational Properties of Topological Indices)
  • Article
  • Open Access
2,235 Views
12 Pages

Coded Distributed Computing Under Combination Networks

  • Yongcheng Yang,
  • Yifei Huang,
  • Xiaohuan Qin and
  • Shenglian Lu

16 March 2025

Coded distributed computing (CDC) is a powerful approach to reduce the communication overhead in distributed computing frameworks by utilizing coding techniques. In this paper, we focus on the CDC problem in (H,L)-combination networks, where H APs ac...

(This article belongs to the Special Issue Network Information Theory and Its Applications)
  • Article
  • Open Access
1 Citations
1,707 Views
18 Pages

14 January 2024

“Linearly many faults” is a phenomenon observed by Cheng and Lipták in which a specific structure emerges when a graph is disconnected and often occurs in various interconnection networks. This phenomenon means that if a certain nu...

(This article belongs to the Special Issue Graph Theory: Advanced Algorithms and Applications)
  • Article
  • Open Access
1 Citations
1,642 Views
19 Pages

Clinical Prediction of Functional Decline in Multiple Sclerosis Using Volumetry-Based Synthetic Brain Networks

  • Alin Ciubotaru,
  • Alexandra Maștaleru,
  • Thomas Gabriel Schreiner,
  • Cristiana Filip and ,
  • Roxana Covali,
  • Laura Riscanu,
  • Robert-Valentin Bilcu,
  • Laura-Elena Cucu,
  • Sofia Alexandra Socolov-Mihaita and
  • Oana-Roxana Bitere-Popa
  • + 11 authors+ 6 authors

11 March 2026

Background: Disability progression in multiple sclerosis (MS) is increasingly recognized as a consequence of large-scale brain network disruption rather than isolated regional damage. Although diffusion tensor imaging (DTI) is the reference method fo...

(This article belongs to the Special Issue From Animal Models to Clinical Innovations: Translating Research into Medicine)
  • Article
  • Open Access
2 Citations
2,573 Views
33 Pages

28 March 2023

In this work, we study the nonlocality of star-shaped correlation tensors (SSCTs) based on a general multi-star-network MSN(m,n1,…,nm). Such a network consists of 1+m+n1+⋯+nm nodes and one center-node A that connects to m star-nodes B1,B...

(This article belongs to the Section E4: Mathematical Physics)
  • Article
  • Open Access
1 Citations
536 Views
17 Pages

17 June 2026

Accurate segmentation of the ureter on abdominal computed tomography (CT) remains challenging due to its thin tubular structure and limited expert-annotated training data. While recent deep learning approaches have shown promise on non-contrast CT, a...

(This article belongs to the Special Issue Advanced Methods and Geometric Approaches for Computer Vision and Pattern Recognition)
  • Article
  • Open Access
9 Citations
2,884 Views
10 Pages

Background: Obstructive sleep apnea syndrome (OSAS) is a widespread respiratory disease that is associated with recurrent breathing intermissions at night. The corresponding oxidative stress triggers a low-grade systemic inflammation which leads to a...

(This article belongs to the Special Issue Sleep Disorders: An Interdisciplinary Approach)
  • Article
  • Open Access
22 Citations
3,591 Views
12 Pages

On the Non Metrizability of Berwald Finsler Spacetimes

  • Andrea Fuster,
  • Sjors Heefer,
  • Christian Pfeifer and
  • Nicoleta Voicu

We investigate whether Szabo’s metrizability theorem can be extended to Finsler spaces of indefinite signature. For smooth, positive definite Finsler metrics, this important theorem states that, if the metric is of Berwald type (i.e., its Chern...

(This article belongs to the Special Issue Finsler Modification of Classical General Relativity)
  • Article
  • Open Access
1,356 Views
36 Pages

1 October 2025

We consider combinatorial multi-access coded caching with private caches, where users are connected to two types of caches: private caches and multi-access caches. Each user has its own private cache, while multi-access caches are connected in the sa...

(This article belongs to the Special Issue Information and Coding Theory for Distributed Learning, Storage, Scheduling, and Security)
  • Article
  • Open Access
6 Citations
2,878 Views
6 Pages

5 June 2022

For a graph G=(V,E) and a set S⊆V(G) of a size at least 2, a path in G is said to be an S-path if it connects all vertices of S. Two S-paths P1 and P2 are said to be internally disjoint if E(P1)∩E(P2)=∅ and V(P1)∩V(P2)=S; that is,...

(This article belongs to the Special Issue Graph Theory with Applications)
  • Article
  • Open Access
6 Citations
3,992 Views
21 Pages

30 October 2020

Studying real-world networks such as social networks or web networks is a challenge. These networks often combine a complex, highly connected structure together with a large size. We propose a new approach for large scale networks that is able to aut...

(This article belongs to the Special Issue Efficient Graph Algorithms in Machine Learning)
  • Article
  • Open Access
6 Citations
4,647 Views
12 Pages

Recommending Links to Control Elections via Social Influence

  • Federico Corò,
  • Gianlorenzo D’Angelo and
  • Yllka Velaj

1 October 2019

Political parties recently learned that they must use social media campaigns along with advertising on traditional media to defeat their opponents. Before the campaign starts, it is important for a political party to establish and ensure its media pr...

(This article belongs to the Special Issue Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems)
  • Article
  • Open Access
1 Citations
6,480 Views
17 Pages

5 March 2019

Given a dataset, we quantify the size of patterns that must always exist in the dataset. This is done formally through the lens of Ramsey theory of graphs, and a quantitative bound known as Goodman’s theorem. By combining statistical tools with...

  • Article
  • Open Access
2,596 Views
18 Pages

Total Outer-Independent Domination Number: Bounds and Algorithms

  • Paul Bosch,
  • Ernesto Parra Inza,
  • Ismael Rios Villamar and
  • José Luis Sánchez-Santiesteban

10 March 2025

In graph theory, the study of domination sets has garnered significant interest due to its applications in network design and analysis. Consider a graph G(V,E); a subset of its vertices is a total dominating set (TDS) if, for each x∈V(G), there...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
3 Citations
1,881 Views
18 Pages

8 August 2023

Let S be a Clifford semigroup and A a subset of S. We write Cay(S,A) for the Cayley digraph of a Clifford semigroup S relative to A. The (weak, path, weak path) independence number of a graph is the maximum cardinality of an (weakly, path, weakly pat...

(This article belongs to the Special Issue Algebraic Structures and Graph Theory, 2nd Edition)
  • Article
  • Open Access
3 Citations
3,062 Views
16 Pages

29 August 2022

The performance of artificial neural networks (ANNs) is highly influenced by the selection of input variables and the architecture defined by hyper parameters such as the number of neurons in the hidden layer and connections between network variables...

(This article belongs to the Special Issue Tools, Approaches and Modeling for Energy System Design Increasing Economic and Environmental Sustainability)
  • Article
  • Open Access
2 Citations
3,340 Views
14 Pages

An MPA Design Approach to Benefit Fisheries: Maximising Larval Export and Minimising Redundancy

  • Colm Tong,
  • Karlo Hock,
  • Nils C. Krueck,
  • Vladimir Tyazhelnikov and
  • Peter J. Mumby

17 November 2021

In the design of marine protected areas (MPAs), tailoring reserve placement to facilitate larval export beyond reserve boundaries may support fished populations and fisheries through recruitment subsidies. Intuitively, capturing such connectivity cou...

(This article belongs to the Section Marine Diversity)
  • Article
  • Open Access
626 Views
15 Pages

9 April 2026

Following Bauer’s 1985 question on how a graph’s minimum degree relates to it being supereulerian, Catlin solved the problem for graphs with a minimum degree of at least n5. Subsequently, Lai solved it for the case where the minimum degre...

  • Article
  • Open Access
2 Citations
2,059 Views
16 Pages

Autonomous Second-Order ODEs: A Geometric Approach

  • Antonio J. Pan-Collantes and
  • José Antonio Álvarez-García

14 November 2024

Given an autonomous second-order ordinary differential equation (ODE), we define a Riemannian metric on an open subset of the first-order jet bundle. A relationship is established between the solutions of the ODE and the geodesic curves with respect...

(This article belongs to the Section Mathematical Analysis)
  • Feature Paper
  • Article
  • Open Access
1 Citations
497 Views
14 Pages

An Algebraic Approach to Geodesics via Mobi Spaces

  • Jorge Pereira Fatelo and
  • Nelson Martins-Ferreira

9 May 2026

Mobi spaces were introduced by the authors as a possible algebraic axiomatization of spaces in which any two points are connected by a geodesic path. Previous work has focused primarily on the algebraic properties of these structures; here, we return...

(This article belongs to the Special Issue Theory and Applications: Differential Geometry)
  • Article
  • Open Access
2 Citations
2,214 Views
11 Pages

27 March 2025

This paper presents a combinatorial perspective on evaluating the permanent for a rectangular matrix. It proves that the permanent can be computed using the permanents of its largest square submatrices. The proof employs a structured combinatorial me...

(This article belongs to the Special Issue Symmetry in Combinatorics and Discrete Mathematics)

of 10