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

461 Results Found

  • Feature Paper
  • Article
  • Open Access
5 Citations
4,862 Views
31 Pages

25 April 2022

The present paper offers, in its first part, a unified approach for the derivation of families of inequalities for set functions which satisfy sub/supermodularity properties. It applies this approach for the derivation of information inequalities wit...

(This article belongs to the Special Issue Information and Divergence Measures)
  • Article
  • Open Access
21 Citations
9,787 Views
25 Pages

Graph Extremities Defined by Search Algorithms

  • Anne Berry,
  • Jean R.S. Blair,
  • Jean-Paul Bordat and
  • Geneviève Simonet

24 March 2010

Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms cal...

  • Article
  • Open Access
797 Views
15 Pages

Extremal Permanents of Laplacian Matrices of Unicyclic Graphs

  • Tingzeng Wu,
  • Xiuhong Wang and
  • Xiangshuai Dong

24 July 2025

The extremal problem of Laplacian permanents of graphs is a classical and challenging topic in algebraic combinatorics, where the inherent #P-complete complexity of permanent computation renders this pursuit particularly intractable. In this paper, w...

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

17 September 2025

Network reliability refers to a probabilistic measure of a network system’s ability to maintain its intended service functionality within a specified time interval and under given operating conditions. Let Ω(n,m) be the set of all simple...

(This article belongs to the Section C: Mathematical Analysis)
  • Article
  • Open Access
2 Citations
2,671 Views
7 Pages

14 November 2022

A topological index being a graph theoretic parameter plays a role of function for the assignment of a numerical value to a molecular graph which predicts the several physical and chemical properties of the underlying molecular graph such as heat of...

(This article belongs to the Special Issue Combinatorics, Discrete Mathematics, Symmetry and Regularity in Graphs, Graph Indices, Graph Parameters and Applications of Graph Theory)
  • Article
  • Open Access
1 Citations
3,428 Views
11 Pages

21 November 2018

The vertex k-partiteness of graph G is defined as the fewest number of vertices whose deletion from G yields a k-partite graph. In this paper, we characterize the extremal value of the reformulated first Zagreb index, the multiplicative-sum Zagreb in...

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

5 February 2016

Edge-independent random graphs are a model of random graphs in which each potential edge appears independently with an individual probability. Based on the relative entropy method, we determine the upper and lower bounds for the extremal vertex degre...

(This article belongs to the Section Complexity)
  • Article
  • Open Access
10 Citations
5,345 Views
8 Pages

13 May 2016

Many graph invariants have been used for the construction of entropy-based measures to characterize the structure of complex networks. The starting point has been always based on assigning a probability distribution to a network when using Shannon’s...

(This article belongs to the Special Issue Machine Learning and Entropy: Discover Unknown Unknowns in Complex Data Sets)
  • Article
  • Open Access
1 Citations
1,606 Views
15 Pages

12 October 2024

In this study, we examined how the nonlinearity α of the Langevin equation influences the behavior of extremes in a generated time series. The extremes, defined according to run theory, result in two types of series, run lengths and s...

(This article belongs to the Special Issue Recent Advances in Time Series Analysis)
  • Feature Paper
  • Article
  • Open Access
14 Citations
5,486 Views
26 Pages

8 June 2021

Finding an optimal/quasi-optimal path for Unmanned Aerial Vehicles (UAVs) utilizing full map information yields time performance degradation in large and complex three-dimensional (3D) urban environments populated by various obstacles. A major portio...

(This article belongs to the Special Issue Unmanned Aerial Vehicles)
  • Article
  • Open Access
23 Citations
2,735 Views
14 Pages

A Unified Approach for Extremal General Exponential Multiplicative Zagreb Indices

  • Rashad Ismail,
  • Muhammad Azeem,
  • Yilun Shang,
  • Muhammad Imran and
  • Ali Ahmad

9 July 2023

The study of the maximum and minimal characteristics of graphs is the focus of the significant field of mathematics known as extreme graph theory. Finding the biggest or smallest graphs that meet specified criteria is the main goal of this discipline...

(This article belongs to the Special Issue Spectral Graph Theory, Molecular Graph Theory and Their Applications)
  • Article
  • Open Access
3 Citations
1,024 Views
11 Pages

24 April 2025

Recently, the exponential arithmetic–geometric index (EAG) was introduced. The exponential arithmetic–geometric index (EAG) of a graph G is defined as EAG(G)=∑vivj∈E(G)edi+dj2didj, where di represents the degree of the vertex vi...

(This article belongs to the Special Issue Graph Theory and Applications, 2nd Edition)
  • Article
  • Open Access
398 Views
16 Pages

Reciprocal Mean Square Index of Graphs

  • Abdulaziz Mutlaq Alotaibi and
  • Akbar Ali

5 August 2026

The reciprocal mean square (RMS) index of a graph G with edge set E(G) is defined by RMS(G)=∑uv∈E(G)[(d(u))2+(d(v))2]−1, where d(u) and d(v) are the degrees of vertices u and v, respectively. We first establish several bounds for the R...

(This article belongs to the Special Issue Advances in Graph Theory and Combinatorics)
  • Article
  • Open Access
195 Views
16 Pages

10 October 2026

The Sombor index of a graph G is SO(G)=∑uv∈E(G)(dG(u)2+dG(v)2)1/2, where dG(v) denotes the degree of v. The repetition number of G is the maximum multiplicity of an entry in its degree sequence. In this paper, we determine the maximum Sombor...

(This article belongs to the Special Issue Advances in Graph Theory and Its Application)
  • Article
  • Open Access
3 Citations
3,260 Views
12 Pages

18 January 2024

In this work, we determine the maximum general Randić index (a general symmetric function of vertex degrees) for η0≤η<0 among all n-vertex unicyclic graphs with a fixed maximum degree Δ and the maximum and the second maximum general Randić index f...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
4 Citations
2,876 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
34 Citations
8,368 Views
14 Pages

Entropy of Weighted Graphs with Randi´c Weights

  • Zengqiang Chen,
  • Matthias Dehmer,
  • Frank Emmert-Streib and
  • Yongtang Shi

5 June 2015

Shannon entropies for networks have been widely introduced. However, entropies for weighted graphs have been little investigated. Inspired by the work due to Eagle et al., we introduce the concept of graph entropy for special weighted graphs. Further...

  • Article
  • Open Access
1 Citations
495 Views
26 Pages

24 June 2026

The limited augmented Zarankiewicz number provides a combinatorial lower bound for the maximum SOS rank of biquadratic forms and refines the classical Zarankiewicz number by allowing admissible augmented edges. In this paper, new lower bounds for thi...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
1,475 Views
17 Pages

23 December 2025

A chemical graph is an illustration of a chemical compound’s structural formula, where the edges indicate covalent bonding and the vertices depict atoms. In the study of (molecular) graphs, Zagreb indices and their variations are the most studi...

(This article belongs to the Special Issue Recent Advances in Graph Theory, Applications and Related Topics)
  • Article
  • Open Access
66 Views
14 Pages

5 November 2026

For a connected graph, the Fermat difference of three vertices is defined as the minimum sum of their distances to a common vertex minus half the sum of their pairwise distances. In this paper, we investigate the average Fermat difference of unicycli...

(This article belongs to the Special Issue Advances and Applications in Graph Theory)
  • Article
  • Open Access
1 Citations
2,086 Views
13 Pages

The Difference of Zagreb Indices of Halin Graphs

  • Lina Zheng,
  • Yiqiao Wang and
  • Weifan Wang

2 May 2023

The difference of Zagreb indices of a graph G is defined as ΔM(G)=∑u∈V(G)(d(u))2−∑uv∈E(G)d(u)d(v), where d(x) denotes the degree of a vertex x in G. A Halin graph G is a graph that results from a plane tree T without ver...

(This article belongs to the Special Issue Graph Theory and Discrete Applied Mathematics)
  • Feature Paper
  • Article
  • Open Access
5 Citations
5,654 Views
20 Pages

Gromov Hyperbolicity in Mycielskian Graphs

  • Ana Granados,
  • Domingo Pestana,
  • Ana Portilla and
  • José M. Rodríguez

27 July 2017

Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph G M is hyperbolic and t...

(This article belongs to the Special Issue Graph Theory)
  • Article
  • Open Access
41 Citations
2,925 Views
14 Pages

11 May 2023

Degree sequence measurements on graphs have attracted a lot of research interest in recent decades. Multiplying the degrees of adjacent vertices in graph Ω provides the multiplicative first Zagreb index of a graph. In the context of graph theor...

(This article belongs to the Special Issue Graph Theory and Applications)
  • Article
  • Open Access
1 Citations
2,090 Views
9 Pages

21 September 2022

In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do not contain small books as a subgraph and characterize all extremal graphs. In addition, we give an upper bound of the signless Laplacian spectral radiu...

  • Article
  • Open Access
7 Citations
3,713 Views
12 Pages

Some Bounds on Zeroth-Order General Randić Index

  • Muhammad Kamran Jamil,
  • Ioan Tomescu,
  • Muhammad Imran and
  • Aisha Javed

7 January 2020

For a graph G without isolated vertices, the inverse degree of a graph G is defined as I D ( G ) = ∑ u ∈ V ( G ) d ( u ) − 1 where d ( u ) is the number of vertices adjacent to the vertex u in G. By replacin...

(This article belongs to the Special Issue Graph Theory at Work in Carbon Chemistry)
  • Article
  • Open Access
9 Citations
4,001 Views
13 Pages

Let G = ( V ( G ) , E ( G ) ) be a connected graph. An ordered set W ⊂ V ( G ) is a resolving set for G if every vertex of G is uniquely determined by its vector of distances to the vertices in W. The metric dimension of G is the...

  • Article
  • Open Access
1,108 Views
14 Pages

The Steiner k-Wiener Index of Cacti

  • Chengye Xu and
  • Mengmeng Liu

22 August 2025

Let G be a connected graph. The Steiner k-Wiener index SWk(G) of graph G is defined as SWk(G)=∑S⊆V(G),|S|=kdG(S), where dG(S) represents the minimum size of a connected subgraph of G that connects S. Using some graph operations, we obtain th...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
3 Citations
2,628 Views
9 Pages

Bounds on the General Eccentric Connectivity Index

  • Xinhong Yu,
  • Muhammad Imran,
  • Aisha Javed,
  • Muhammad Kamran Jamil and
  • Xuewu Zuo

4 December 2022

The general eccentric connectivity index of a graph R is defined as ξec(R)=∑u∈V(G)d(u)ec(u)α, where α is any real number, ec(u) and d(u) represent the eccentricity and the degree of the vertex u in R, respectively. In this pap...

(This article belongs to the Special Issue Combinatorics, Discrete Mathematics, Symmetry and Regularity in Graphs, Graph Indices, Graph Parameters and Applications of Graph Theory)
  • Article
  • Open Access
35 Citations
4,189 Views
13 Pages

CGENet: A Deep Graph Model for COVID-19 Detection Based on Chest CT

  • Si-Yuan Lu,
  • Zheng Zhang,
  • Yu-Dong Zhang and
  • Shui-Hua Wang

27 December 2021

Accurate and timely diagnosis of COVID-19 is indispensable to control its spread. This study proposes a novel explainable COVID-19 diagnosis system called CGENet based on graph embedding and an extreme learning machine for chest CT images. We put for...

(This article belongs to the Topic Big Data in Healthcare, Bioinformatics and Precision Medicine)
  • Article
  • Open Access
11 Citations
5,561 Views
14 Pages

2 April 2018

Recently, Multi-Graph Learning was proposed as the extension of Multi-Instance Learning and has achieved some successes. However, to the best of our knowledge, currently, there is no study working on Multi-Graph Multi-Label Learning, where each objec...

(This article belongs to the Special Issue Entropy-based Data Mining)
  • Article
  • Open Access
10 Citations
3,720 Views
13 Pages

Extremal Graphs for Sombor Index with Given Parameters

  • Wanping Zhang,
  • Jixiang Meng and
  • Na Wang

15 February 2023

In this paper, we present the upper and lower bounds on Sombor index SO(G) among all connected graphs (respectively, connected bipartite graphs). We give some sharp lower and upper bounds on SO(G) among connected graphs in terms of some parameters, i...

(This article belongs to the Special Issue Graph Theory and Discrete Applied Mathematics)
  • Article
  • Open Access
16 Citations
2,397 Views
13 Pages

9 October 2021

A vertex-degree-based (VDB, for short) topological index φ induced by the numbers φij was recently defined for a digraph D, as φD=12∑uvφdu+dv−, where du+ denotes the out-degree of the vertex u,dv− denotes the in-degree of the vertex v, and the sum ru...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
63 Citations
7,995 Views
19 Pages

Hard-Rock Stability Analysis for Span Design in Entry-Type Excavations with Learning Classifiers

  • Esperanza García-Gonzalo,
  • Zulima Fernández-Muñiz,
  • Paulino José García Nieto,
  • Antonio Bernardo Sánchez and
  • Marta Menéndez Fernández

29 June 2016

The mining industry relies heavily on empirical analysis for design and prediction. An empirical design method, called the critical span graph, was developed specifically for rock stability analysis in entry-type excavations, based on an extensive ca...

(This article belongs to the Section Advanced Materials Characterization)
  • Article
  • Open Access
72 Citations
5,007 Views
15 Pages

Some Extremal Graphs with Respect to Sombor Index

  • Kinkar Chandra Das and
  • Yilun Shang

25 May 2021

Let G be a graph with set of vertices V(G)(|V(G)|=n) and edge set E(G). Very recently, a new degree-based molecular structure descriptor, called Sombor index is denoted by SO(G) and is defined as SO=SO(G)=∑vivj∈E(G)dG(vi)2+dG(vj)2, where dG(vi) is th...

  • Article
  • Open Access
1,168 Views
15 Pages

Sharp Choice Number Thresholds for Complete Bipartite Graphs

  • Julian Allagan,
  • Benkam Bobga,
  • Jianning Su,
  • Weizheng Gao and
  • Shanzhen Gao

27 March 2026

Fix m≥3. The choice number ch(Km,n) of the complete bipartite graph Km,n has two sharp thresholds as n grows. We give complete proofs of the Hoffman–Johnson values at levels m+1 and m, and we pin down the extremal list assignments at the low...

(This article belongs to the Special Issue Combinatorics and Graph Theory with Applications in Computer Science)
  • Article
  • Open Access
69 Citations
6,173 Views
19 Pages

Fault-Tolerant Resolvability and Extremal Structures of Graphs

  • Hassan Raza,
  • Sakander Hayat,
  • Muhammad Imran and
  • Xiang-Feng Pan

14 January 2019

In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs with fault-tolerant metric dimension n, n − 1 , and 2, which are the lower and upper extremal cases. Furthermore, in the first part of th...

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

17 April 2026

To address the vulnerability of renewable-dominated power grids to cascading failures under extreme conditions and the limitations of existing methods in jointly handling vulnerability identification, energy storage allocation, and online control, th...

(This article belongs to the Section F1: Electrical Power System)
  • Article
  • Open Access
631 Views
32 Pages

17 August 2026

Graph Neural Networks achieve strong closed-set accuracy in network intrusion detection but cannot flag zero-day attacks, because the closed-world assumption forces every input into a known class. OpenMax adds an Extreme Value Theory reject option, y...

(This article belongs to the Special Issue Emerging Research Trends and Technologies in Intrusion Detection Systems (IDSs) and Artificial Intelligence (AI) Utilization)
  • Article
  • Open Access
2,924 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
20 Citations
7,333 Views
23 Pages

30 November 2021

This study proposes a framework to diagnose stock market crashes and predict the subsequent price rebounds. Based on the observation of anomalous changes in stock correlation networks during market crashes, we extend the log-periodic power-law model...

(This article belongs to the Special Issue Structure and Dynamics of Complex Socioeconomic Networks)
  • Article
  • Open Access
3 Citations
2,429 Views
12 Pages

20 January 2024

The Sombor index is defined as SO(G)=∑uv∈E(G)d2(u)+d2(v), where d(u) and d(v) represent the number of edges in the graph G connected to the vertices u and v, respectively. In this paper, we characterize the largest and second largest Sombor...

(This article belongs to the Special Issue Advances in Graph Theory and Combinatorial Optimization)
  • Article
  • Open Access
285 Views
26 Pages

4 October 2026

Extreme-event restoration requires damaged distribution feeders to coordinate sequential line repair with time-dependent support from industrial microgrids. Temporary industrial load reduction releases capacity during outages but creates recovery obl...

(This article belongs to the Special Issue AI-Enabled Demand-Side Flexibility: Forecasting, Coordination and Market Participation)
  • Article
  • Open Access
14 Citations
3,201 Views
13 Pages

Extremal Graphs to Vertex Degree Function Index for Convex Functions

  • Dong He,
  • Zhen Ji,
  • Chenxu Yang and
  • Kinkar Chandra Das

27 December 2022

The vertex-degree function index Hf(Γ) is defined as Hf(Γ)=∑v∈V(Γ)f(d(v)) for a function f(x) defined on non-negative real numbers. In this paper, we determine the extremal graphs with the maximum (minimum) vertex degr...

(This article belongs to the Special Issue Spectral Graph Theory, Molecular Graph Theory and Their Applications)
  • Article
  • Open Access
2,105 Views
16 Pages

10 August 2022

For a given graph G, Sze*(G)=∑e=uv∈E(G)mu(e)+m0(e)2mv(e)+m0(e)2 is the revised edge-Szeged index of G, where mu(e) and mv(e) are the number of edges of G lying closer to vertex u than to vertex v and the number of edges of G lying closer to...

(This article belongs to the Special Issue Symmetry in Graph and Hypergraph Theory)
  • Article
  • Open Access
9 Citations
1,774 Views
12 Pages

26 March 2025

With geometric significance, the Euler Sombor index of a graph Γ is defined as EP(Γ)=∑{uv}∈E(Γ)d(u)2+d(v)2+d(u)d(v). It originates from the mathematical distance property and has been proven to have good chemical applicatio...

(This article belongs to the Special Issue Advances in Combinatorial Optimization and Discrete Mathematics with Applications)
  • Article
  • Open Access
1,270 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
684 Views
20 Pages

Deep learning has become a popular topic among scholars and has attracted widespread attention. However, deep learning methods typically require large datasets to determine model parameters and can only process data in batches. To address the challen...

(This article belongs to the Section Power Electronics)
  • Article
  • Open Access
1 Citations
1,390 Views
15 Pages

23 November 2024

We study the algebraic connectivity for several classes of random semi-regular graphs. For large random semi-regular bipartite graphs, we explicitly compute both their algebraic connectivity as well as the full spectrum distribution. For an integer d...

(This article belongs to the Section Information Theory, Probability and Statistics)

of 10