Skip to Content

1,217 Results Found

  • Article
  • Open Access
1 Citations
2,847 Views
22 Pages

1 October 2022

Recently, many information processing applications appear on the web on the demand of user requirement. Since text is one of the most popular data formats across the web, how to measure text similarity becomes the key challenge to many web applicatio...

(This article belongs to the Special Issue Data Analysis and Mining)
  • Article
  • Open Access
7 Citations
2,512 Views
20 Pages

Multi-Objective Power Supply Restoration in Distribution Networks Based on Graph Calculation and Information Collected by Multi-Source Sensors

  • Jian Dang,
  • Shaopeng Zhang,
  • Yile Wang,
  • Yunjiang Yan and ,
  • Rong Jia and
  • Guangyi Liu
  • + 1 author+ 0 author

27 January 2025

With the increasing complexity of the distribution network structure, enhancing the efficiency and reliability during fault restoration has become a focal point. Based on the multi-source information collected by traditional sensors, such as CT and P...

(This article belongs to the Special Issue Sensor and Sensorless Technology with Renewable Energy and Flexible Load Participation in Active Distribution Network)
  • Article
  • Open Access
1 Citations
530 Views
27 Pages

23 June 2026

As power systems continue to expand and grow in complexity, power flow calculation remains a fundamental task in power system analysis and operation. Conventional methods rely on iterative solvers and detailed grid models, yet are often hindered by n...

(This article belongs to the Special Issue Artificial Intelligence and Game Theory)
  • Article
  • Open Access
1 Citations
1,614 Views
25 Pages

13 April 2025

Coordinate registration (CR) is the key technology for improving the target positioning accuracy of sky-wave over-the-horizon radar (OTHR). The CR parameters are derived by matching the sea–land clutter classification (SLCC) results with prior...

(This article belongs to the Special Issue Advances in Remote Sensing, Radar Techniques, and Their Applications)
  • Article
  • Open Access
2 Citations
4,681 Views
16 Pages

Land Use Thematic Maps Recommendation Based on Pan-Map Visualization Dimension Theory

  • Yebin Chen,
  • Zhicheng Shi,
  • Yaxing Li,
  • Dezhi Han and ,
  • Minmin Li and
  • Zhigang Zhao
  • + 1 author+ 0 author

29 August 2024

In the era of information and communication technology (ICT), the advancement of science and technology has led to a trend of diversification in map representation. However, the lack of professional knowledge means that there is still a challenge in...

(This article belongs to the Special Issue Recent Progress in RS&GIS-Based Urban Planning)
  • Article
  • Open Access
525 Views
20 Pages

20 April 2026

Planar multi-loop mechanisms often generate a large number of non-isomorphic candidate topological graphs during automatic synthesis, making it difficult to efficiently identify configurations that satisfy engineering-oriented functional requirements...

(This article belongs to the Section Machine Design and Theory)
  • Article
  • Open Access
2,355 Views
18 Pages

Graph-Analytical Method for Calculating Settlement of a Single Pile Taking into Account Soil Slippage

  • Armen Z. Ter-Martirosyan,
  • Vitalii V. Sidorov and
  • Anastasiia S. Almakaeva

9 September 2024

Most of the existing methods of pile settlement calculation, including normative methods, do not fully take into account the processes occurring in the soil when loads are transferred to them and the changes in the properties of the contact zone soil...

(This article belongs to the Special Issue Soil-Structure Interaction in Structural and Geotechnical Engineering)
  • Article
  • Open Access
2 Citations
2,776 Views
30 Pages

Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs

  • Rolando Quintero,
  • Esteban Mendiola,
  • Giovanni Guzmán,
  • Miguel Torres-Ruiz and
  • Carlos Guzmán Sánchez-Mejorada

28 November 2023

Conceptual distance refers to the degree of proximity between two concepts within a conceptualization. It is closely related to semantic similarity and relationships, but its measurement strongly depends on the context of the given concepts. DIS-C re...

(This article belongs to the Special Issue Information Systems Modeling Based on Graph Theory)
  • Article
  • Open Access
1 Citations
2,807 Views
12 Pages

22 February 2024

In this paper, the graph theory model of the kinematics of the double internal meshing planetary gear is established by splitting the k value of the planetary gear, the system matrix of the dual-state logic planetary gear transmission is assembled, t...

(This article belongs to the Section Mechanical Engineering)
  • Article
  • Open Access
1 Citations
2,218 Views
15 Pages

Calculation and Analysis of Petri Net Reachability Graphs by a Think-Globally-Act-Locally Method

  • Chengzong Li,
  • Fubao Jin,
  • Yufeng Chen,
  • Zhiwu Li and ,
  • Murat Uzam and
  • Huimin Ma
  • + 1 author+ 0 author

27 February 2025

A think-globally-act-locally (TGAL) technique is proven to be an effective method to address the state explosion issue for complex discrete event systems modeled with Petri nets. This paper introduces a TGAL-based method for computing and analyzing t...

(This article belongs to the Special Issue Discrete Event Dynamic Systems and Applications)
  • Article
  • Open Access
23 Citations
14,995 Views
15 Pages

31 December 2004

We report the results of a calculation of the normal boiling points of a representative set of 200 organic molecules through the application of QSPR theory. For this purpose we have used a particular set of flexible molecular descriptors, the so call...

  • Article
  • Open Access
10 Citations
4,347 Views
20 Pages

The paper is written to demonstrate the applicability of the notion of triangulation typically used in social sciences research to computationally enhance the mathematics education of future K-12 teachers. The paper starts with the so-called Brain Te...

(This article belongs to the Special Issue Computational Social Science and Complex Systems)
  • Article
  • Open Access
41 Citations
3,264 Views
19 Pages

Computation of Entropy Measures for Metal-Organic Frameworks

  • Muhammad Imran,
  • Abdul Rauf Khan,
  • Mohamad Nazri Husin,
  • Fairouz Tchier and ,
  • Muhammad Usman Ghani and
  • Shahid Hussain
  • + 1 author+ 0 author

13 June 2023

Entropy is a thermodynamic function used in chemistry to determine the disorder and irregularities of molecules in a specific system or process. It does this by calculating the possible configurations for each molecule. It is applicable to numerous i...

(This article belongs to the Special Issue Multifunctional Metal-Organic Framework Materials)
  • Article
  • Open Access
21 Citations
5,324 Views
23 Pages

11 October 2022

The rapid changes in information and communication technology (ICT), the increasing availability of processing power, and the complexity of mathematical software demand a radical re-thinking of science, technology, engineering, arts, and mathematics...

(This article belongs to the Special Issue Sustainable Development of STEAM and Mathematics Education with Active and Innovative Methodology)
  • Article
  • Open Access
1 Citations
2,987 Views
16 Pages

Design of Irregularly Distributed Antenna Array towards Smart 6G Networks

  • Kunye Wang,
  • Zheng Ma,
  • Yao Zhao,
  • Yunkai Deng and ,
  • Yunhua Luo,
  • Mang He and
  • Haitao Xu
  • + 2 authors+ 0 author

30 September 2022

The integration of sensing, computing, storage, and communications is one of the main research directions of current network development. To achieve the integration, an innovative design in the antenna array is essential. This paper presents a novel...

(This article belongs to the Special Issue Integration of Sensing, Computing, Storage and Communications towards Smart 6G Networks)
  • Article
  • Open Access
313 Views
24 Pages

Data-Driven Power Flow Calculation Method for Active Distribution Network Based on PIGAT

  • Shiwei Xue,
  • Xuekai Hu,
  • Zixiao Fan,
  • Rui Ma and ,
  • Ruofei Wang,
  • Ningsai Su and
  • Bo Zhang
  • + 2 authors+ 0 author

19 September 2026

With the increasing penetration of electric vehicles (EVs) and distributed energy resources, source-load uncertainty, spatiotemporal variability, and nonlinear coupling make rapid and accurate assessment of operating states more difficult in active d...

(This article belongs to the Topic Artificial Intelligence and Deep Learning for Energy Systems and Power Systems)
  • Article
  • Open Access
1 Citations
2,837 Views
13 Pages

7 January 2023

The main aim of the paper is to give the crossing number of the join product G*+Dn. The connected graph G* of order six is isomorphic to K3,3\e obtained by removing one edge from the complete bipartite graph K3,3, and the discrete graph Dn consists o...

(This article belongs to the Special Issue Graph Algorithms and Graph Theory II)
  • Article
  • Open Access
3 Citations
2,420 Views
12 Pages

A Combinatorial Approach to the Computation of the Fractional Edge Dimension of Graphs

  • Nosheen Goshi,
  • Sohail Zafar,
  • Tabasam Rashid and
  • Juan L. G. Guirao

23 September 2021

E. Yi recently introduced the fractional edge dimension of graphs. It has many applications in different areas of computer science such as in sensor networking, intelligent systems, optimization, and robot navigation. In this paper, the fractional ed...

(This article belongs to the Special Issue Symmetry Methods and Applications for Nonlinear Partial Differential Equations)
  • Article
  • Open Access
10 Citations
2,867 Views
14 Pages

Constant Time Calculation of the Metric Dimension of the Join of Path Graphs

  • Chuanjun Zhang,
  • Ghulam Haidar,
  • Murad Ul Islam Khan,
  • Faisal Yousafzai and ,
  • Kostaq Hila and
  • Asad Ul Islam Khan
  • + 1 author+ 0 author

12 March 2023

The distance between two vertices of a simple connected graph G, denoted as d(u,v), is the length of the shortest path from u to v and is always symmetrical. An ordered subset W=w1,w2,w3,⋯,wk of V(G) is a resolving set for G, if for ∀u,v...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
3 Citations
6,725 Views
19 Pages

Relating Vertex and Global Graph Entropy in Randomly Generated Graphs

  • Philip Tee,
  • George Parisis,
  • Luc Berthouze and
  • Ian Wakeman

21 June 2018

Combinatoric measures of entropy capture the complexity of a graph but rely upon the calculation of its independent sets, or collections of non-adjacent vertices. This decomposition of the vertex set is a known NP-Complete problem and for most real w...

(This article belongs to the Special Issue Entropy: From Physics to Information Sciences and Geometry)
  • Article
  • Open Access
1,634 Views
12 Pages

Tightness of Harary Graphs

  • Abolfazl Javan,
  • Ali Moeini and
  • Mohammad Shekaramiz

17 September 2024

In the design of real-world networks, researchers evaluate various structural parameters to assess vulnerability, including connectivity, toughness, and tenacity. Recently, the tightness metric has emerged as a potentially superior vulnerability meas...

  • Article
  • Open Access
9 Citations
3,899 Views
19 Pages

GRAPH4: A Security Monitoring Architecture Based on Data Plane Anomaly Detection Metrics Calculated over Attack Graphs

  • Giacomo Gori,
  • Lorenzo Rinieri,
  • Amir Al Sadi,
  • Andrea Melis and ,
  • Franco Callegati and
  • Marco Prandini
  • + 1 author+ 0 author

15 November 2023

The correct and efficient measurement of security properties is key to the deployment of effective cyberspace protection strategies. In this work, we propose GRAPH4, which is a system that combines different security metrics to design an attack detec...

(This article belongs to the Special Issue State-of-the-Art Future Internet Technology in Italy 2022–2023)
  • Article
  • Open Access
2 Citations
3,373 Views
16 Pages

Cost Model Based Incremental Processing in Dynamic Graphs

  • Kyoungsoo Bok,
  • Jungkwon Cho,
  • Hyeonbyeong Lee,
  • Dojin Choi and ,
  • Jongtae Lim and
  • Jaesoo Yoo
  • + 1 author+ 0 author

21 February 2022

Incremental graph processing has been developed to reduce unnecessary redundant calculations in dynamic graphs. In this paper, we propose an incremental dynamic graph-processing scheme using a cost model to selectively perform incremental processing...

(This article belongs to the Collection Graph Machine Learning)
  • Article
  • Open Access
36 Citations
10,309 Views
19 Pages

Shp2graph: Tools to Convert a Spatial Network into an Igraph Graph in R

  • Binbin Lu,
  • Huabo Sun,
  • Paul Harris,
  • Miaozhong Xu and
  • Martin Charlton

In this study, we introduce the R package shp2graph, which provides tools to convert a spatial network into an ‘igraph’ graph of the igraphR package. This conversion greatly empowers a spatial network study, as the vast array of graph ana...

(This article belongs to the Special Issue Free and Open Source Tools for Geospatial Analysis and Mapping)
  • Article
  • Open Access
1,275 Views
9 Pages

31 July 2025

It is well-known that the necessary and sufficient condition for a connected graph to be unicyclic is that its omega invariant, a recently introduced graph invariant useful in combinatorial and topological calculations, is zero. This condition could...

(This article belongs to the Special Issue Graph Theory and Applications, 3rd Edition)
  • Article
  • Open Access
2 Citations
2,517 Views
25 Pages

Top-k Graph Similarity Search Algorithm Based on Chi-Square Statistics in Probabilistic Graphs

  • Ziyang Chen,
  • Junhao Zhuang,
  • Xuan Wang,
  • Xian Tang and ,
  • Kun Yang,
  • Ming Du and
  • Junfeng Zhou
  • + 2 authors+ 0 author

Top-k graph similarity search on probabilistic graphs is widely used in various scenarios, such as symptom–disease diagnostics, community discovery, visual pattern recognition, and communication networks. The state-of-the-art method uses the ch...

(This article belongs to the Special Issue Advances in Graph-Based Data Mining)
  • Article
  • Open Access
5 Citations
3,640 Views
18 Pages

GraphPhos: Predict Protein-Phosphorylation Sites Based on Graph Neural Networks

  • Zeyu Wang,
  • Xiaoli Yang,
  • Songye Gao,
  • Yanchun Liang and
  • Xiaohu Shi

Phosphorylation is one of the most common protein post-translational modifications. The identification of phosphorylation sites serves as the cornerstone for protein-phosphorylation-related research. This paper proposes a protein-phosphorylation site...

(This article belongs to the Section Molecular Informatics)
  • Article
  • Open Access
5 Citations
1,329 Views
14 Pages

6 June 2025

In this paper, we generate random graphs for a specific area, namely, models of real communication networks. We propose a method that determines the “best” invariant; the corresponding basic algorithm is as follows. For the generated set...

(This article belongs to the Special Issue Graph Theory and Applications, 2nd Edition)
  • Feature Paper
  • Article
  • Open Access
1 Citations
1,382 Views
13 Pages

Further Exploration of an Upper Bound for Kemeny’s Constant

  • Robert E. Kooij and
  • Johan L. A. Dubbeldam

4 April 2025

Even though Kemeny’s constant was first discovered in Markov chains and expressed by Kemeny in terms of mean first passage times on a graph, it can also be expressed using the pseudo-inverse of the Laplacian matrix representing the graph, which...

(This article belongs to the Special Issue Complexity, Entropy and the Physics of Information, 2nd Edition)
  • Article
  • Open Access
4 Citations
3,232 Views
20 Pages

19 November 2020

In self-healing grid systems, high utility in the use of greedy algorithms is observed. One of the most popular solutions is based on Prim’s algorithm. In the computation, the power grid is represented as a weighted graph. This paper presents a...

(This article belongs to the Section F: Electrical Engineering)
  • Article
  • Open Access
11 Citations
4,913 Views
28 Pages

Learning Knowledge Using Frequent Subgraph Mining from Ontology Graph Data

  • Kwangyon Lee,
  • Haemin Jung,
  • June Seok Hong and
  • Wooju Kim

20 January 2021

In many areas, vast amounts of information are rapidly accumulating in the form of ontology-based knowledge graphs, and the use of information in these forms of knowledge graphs is becoming increasingly important. This study proposes a novel method f...

(This article belongs to the Section Computing and Artificial Intelligence)
  • Article
  • Open Access
13 Citations
3,519 Views
12 Pages

Converting Tessellations into Graphs: From Voronoi Tessellations to Complete Graphs

  • Artem Gilevich,
  • Shraga Shoval,
  • Michael Nosonovsky,
  • Mark Frenkel and
  • Edward Bormashenko

5 August 2024

A mathematical procedure enabling the transformation of an arbitrary tessellation of a surface into a bi-colored, complete graph is introduced. Polygons constituting the tessellation are represented by vertices of the graphs. Vertices of the graphs a...

  • Article
  • Open Access
1 Citations
2,592 Views
31 Pages

Graph-DEM: A Graph Neural Network Model for Proxy and Acceleration Discrete Element Method

  • Bohao Li,
  • Bowen Du,
  • Kaixin Liu,
  • Ke Cheng and ,
  • Junchen Ye,
  • Jinyan Feng and
  • Xuhao Cui
  • + 2 authors+ 0 author

26 September 2025

The discrete element method (DEM) is widely employed in various fields for analyzing rock and soil movement. However, the traditional DEM involves a large number of calculations, which leads to reduced computational efficiency. Deep-learning presents...

  • Article
  • Open Access
1,970 Views
12 Pages

Let G be a graph with the adjacency matrix A(G), and let D(G) be the diagonal matrix of the degrees of G. Nikiforov first defined the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), 0≤α≤1, which shed new light on A(G)...

(This article belongs to the Special Issue Discrete Mathematics, Graph Theory and Applications)
  • Article
  • Open Access
12 Citations
4,182 Views
17 Pages

7 November 2019

Fullerenes are molecules that can be presented in the form of cage-like polyhedra, consisting only of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of a vertex v of a graph is a local graph invariant...

(This article belongs to the Special Issue Graph Theory at Work in Carbon Chemistry)
  • Proceeding Paper
  • Open Access
1,704 Views
10 Pages

Rational Wiener Index and Rational Schultz Index of Graphs

  • Belman Gautham Shenoy,
  • Raghavendra Ananthapadmanabha,
  • Badekara Sooryanarayana,
  • Prasanna Poojary and
  • Vishu Kumar Mallappa

18 January 2024

In this research paper, we investigate fundamental graph properties within the context of a simple connected graph denoted as G = (V, E). We introduce the concept of the rational Schultz index. In the context of this paper, our main objective is to c...

(This article belongs to the Proceedings of Eng. Proc., 2023, RAiSE-2023)
  • Article
  • Open Access
1 Citations
1,501 Views
33 Pages

20 February 2025

The enumeration of spanning trees in various graph forms has been made easier by the study of electrically equivalent transformations, which was motivated by Kirchhoff’s work on electrical networks. In this work, using knowledge of difference e...

(This article belongs to the Section Algebra and Number Theory)
  • Article
  • Open Access
5 Citations
4,043 Views
16 Pages

3 March 2022

A graph is a block graph if its blocks are all cliques. In this paper, we study the average eccentricity of block graphs from the perspective of block order sequences. An equivalence relation is established under the block order sequence and used to...

  • Article
  • Open Access
16 Citations
2,769 Views
21 Pages

Let f and g be two continuous functions. In the present paper, we put forward a method to calculate the lower and upper Box dimensions of the graph of f+g by classifying all the subsequences tending to zero into different sets. Using this method, we...

  • Article
  • Open Access
2 Citations
4,694 Views
13 Pages

Kolmogorov Basic Graphs and Their Application in Network Complexity Analysis

  • Amirmohammad Farzaneh,
  • Justin P. Coon and
  • Mihai-Alin Badiu

29 November 2021

Throughout the years, measuring the complexity of networks and graphs has been of great interest to scientists. The Kolmogorov complexity is known as one of the most important tools to measure the complexity of an object. We formalized a method to ca...

(This article belongs to the Collection Graphs and Networks from an Algorithmic Information Perspective)
  • Article
  • Open Access
2,926 Views
11 Pages

2 May 2019

Resistance distance is a concept developed from electronic networks. The calculation of resistance distance in various circuits has attracted the attention of many engineers. This report considers the resistance-based graph invariant, the Resistance&...

  • Article
  • Open Access
5 Citations
3,018 Views
18 Pages

The IRC Indices of Transformation and Derived Graphs

  • Haichang Luo,
  • Sakander Hayat,
  • Yubin Zhong,
  • Zhongyuan Peng and
  • Tamás Réti

30 March 2022

An irregularity index IR(Γ) of a graph Γ is a nonnegative numeric quantity (i.e., IR(Γ)≥0) such that IR(Γ)=0 iff Γ is a regular graph. In this paper, we show that IRC closely correlates with the normal boiling point T...

(This article belongs to the Special Issue Graph Theory and Applications)
  • Article
  • Open Access
1,540 Views
16 Pages

Formulas for the Number of Weak Homomorphisms from Paths to Rectangular Grid Graphs

  • Penying Rochanakul,
  • Hatairat Yingtaweesittikul and
  • Sayan Panma

26 March 2025

A weak homomorphism from graph G to graph H is a mapping f:V(G)→V(H), where either f(x)=f(y) or {f(x),f(y)}∈E(H) hold for all {x,y}∈E(G). A rectangular grid graph is formed by taking the Cartesian product of two paths. Counting weak ho...

(This article belongs to the Special Issue Symmetry and Graph Theory, 2nd Edition)
  • Article
  • Open Access
24 Citations
5,194 Views
16 Pages

On Metric Dimensions of Symmetric Graphs Obtained by Rooted Product

  • Shahid Imran,
  • Muhammad Kamran Siddiqui,
  • Muhammad Imran and
  • Muhammad Hussain

8 October 2018

Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in W. A metric dimension of G...

(This article belongs to the Special Issue Discrete Optimization: Theory, Algorithms, and Applications)
  • Article
  • Open Access
4 Citations
3,010 Views
18 Pages

10 June 2023

Let G=(V,E) be a simple connected graph with vertex set V and edge set E, respectively. The term “anti-reciprocal eigenvalue property“ refers to a non-singular graph G for which, −1λ∈σ(G), whenever λ∈&s...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
23 Citations
7,330 Views
18 Pages

Codeformer: A GNN-Nested Transformer Model for Binary Code Similarity Detection

  • Guangming Liu,
  • Xin Zhou,
  • Jianmin Pang,
  • Feng Yue and ,
  • Wenfu Liu and
  • Junchao Wang
  • + 1 author+ 0 author

Binary code similarity detection is used to calculate the code similarity of a pair of binary functions or files, through a certain calculation method and judgment method. It is a fundamental task in the field of computer binary security. Traditional...

(This article belongs to the Special Issue AI in Cybersecurity)
  • Article
  • Open Access
4 Citations
2,592 Views
14 Pages

Evaluation of Transmission Properties of Networks Described with Reference Graphs Using Unevenness Coefficients

  • Sławomir Bujnowski,
  • Beata Marciniak,
  • Zbigniew Lutowski,
  • Adam Flizikowski and
  • Olutayo Oyeyemi Oyerinde

This paper discusses an evaluation method of transmission properties of networks described with regular graphs (Reference Graphs) using unevenness coefficients. The first part of the paper offers generic information about describing network topology...

(This article belongs to the Special Issue Selected Papers from 14th International Conference on Signal Processing and Communication Systems)
  • Article
  • Open Access
7 Citations
5,066 Views
9 Pages

The problem of quantifying the vulnerability of graphs has received much attention nowadays, especially in the field of computer or communication networks. In a communication network, the vulnerability measures the resistance of the network to disrup...

  • 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
3 Citations
4,405 Views
26 Pages

The Longest (s, t)-Path Problem on O-Shaped Supergrid Graphs

  • Fatemeh Keshavarz-Kohjerdi and
  • Ruo-Wei Hung

15 June 2023

The longest (s,t)-path problem on supergrid graphs is known to be NP-complete. However, the complexity of this problem on supergrid graphs with or without holes is still unknown.In the past, we presented linear-time algorithms for solving the longest...

(This article belongs to the Special Issue Graph Theory: Advanced Algorithms and Applications)

of 25