Skip to Content

234 Results Found

  • 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
1,190 Views
10 Pages

Redundant Trees in Bipartite Graphs

  • Yanmei Hong,
  • Yihong Wu and
  • Qinghai Liu

19 March 2025

It has been conjectured that for each positive integer k and each tree T with bipartite (Z1,Z2), every k-connected bipartite graph G with δ(G)≥k+max{|Z1|,|Z2|} admits a subgraph T′≅T such that G−V(T′) is still k-connec...

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

23 April 2023

Win proved a very famous conclusion that states the graph G with connectivity κ(G), independence number α(G) and α(G)≤κ(G)+k−1(k≥2) contains a spanning k-ended tree. This means that there exists a spanning tree wit...

(This article belongs to the Special Issue Recent Advances in Graph Theory with Applications)
  • Feature Paper
  • Article
  • Open Access
8 Citations
5,681 Views
28 Pages

15 March 2018

A Pogorelov polytope is a combinatorial simple 3-polytope realizable in the Lobachevsky (hyperbolic) space as a bounded right-angled polytope. These polytopes are exactly simple 3-polytopes with cyclically 5-edge connected graphs. A Pogorelov polytop...

(This article belongs to the Special Issue Mathematical Crystallography)
  • Article
  • Open Access
38 Citations
3,347 Views
19 Pages

A Paradigmatic Approach to Find the Valency-Based K-Banhatti and Redefined Zagreb Entropy for Niobium Oxide and a Metal–Organic Framework

  • Muhammad Usman Ghani,
  • Faisal Sultan,
  • El Sayed M. Tag El Din,
  • Abdul Rauf Khan and ,
  • Jia-Bao Liu and
  • Murat Cancan
  • + 1 author+ 0 author

17 October 2022

Entropy is a thermodynamic function in chemistry that reflects the randomness and disorder of molecules in a particular system or process based on the number of alternative configurations accessible to them. Distance-based entropy is used to solve a...

(This article belongs to the Special Issue Study of Molecules in the Light of Spectral Graph Theory)
  • 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
2 Citations
2,485 Views
9 Pages

Study on a Strong and Weak n-Connected Total Perfect k-Dominating set in Fuzzy Graphs

  • Krishnasamy Elavarasan,
  • Tharmalingam Gunasekar,
  • Lenka Cepova and
  • Robert Cep

3 September 2022

In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominating set and a weak n-connected total perfect k-dominating set in fuzzy graphs is introduced. In the current work, the triple-connected total perfect d...

  • 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
2,689 Views
14 Pages

19 August 2022

In 2014, some scholars showed that every 2-connected claw-free graph G with independence number α(G)≤3 is Hamiltonian with one exception of family of graphs. If a nontrivial path contains only internal vertices of degree two and end vertices...

(This article belongs to the Special Issue Graph Theory with Applications)
  • Article
  • Open Access
6 Citations
7,955 Views
12 Pages

Antimagic Labeling for Product of Regular Graphs

  • Vinothkumar Latchoumanane and
  • Murugan Varadhan

14 June 2022

An antimagic labeling of a graph G=(V,E) is a bijection from the set of edges of G to 1,2,⋯,E(G) and such that any two vertices of G have distinct vertex sums where the vertex sum of a vertex v in V(G) is nothing but the sum of all the incident...

(This article belongs to the Special Issue Graph Labelings and Their Applications)
  • Article
  • Open Access
1,110 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
1 Citations
2,128 Views
13 Pages

17 December 2023

A graph with n vertices is called an n-graph. A spanning tree with at most k leaves is referred to as a spanning k-ended tree. Spanning k-ended trees are important in various fields such as network design, graph theory, and communication networks. Th...

(This article belongs to the Special Issue Advanced Graph Theory and Combinatorics)
  • Feature Paper
  • Article
  • Open Access
430 Views
14 Pages

Locally Irregular-Connected Graphs

  • Gary Chartrand and
  • Ping Zhang

25 May 2026

A graph G is locally irregular if every two adjacent vertices have distinct degrees and is locally irregular-connected if for every two vertices u and v of G, there is a locally irregular u−v path in G. For a finite set S of two or more positiv...

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

1 July 2024

A connected graph, G, is Crossing Free-connected (CF-connected) if there is a path between every pair of vertices with no crossing on its edges for each optimal drawing of G. We conjecture that a complete tripartite graph, Kl,m,n, is CF-connected if...

(This article belongs to the Special Issue Advances in Discrete Applied Mathematics and Graph Theory, 3rd Edition)
  • Article
  • Open Access
2 Citations
2,081 Views
19 Pages

1 February 2023

In 1994, Dobrynin and Kochetova introduced the concept of degree distance DD(Γ) of a connected graph Γ. Let dΓ(S) be the Steiner k-distance of S⊆V(Γ). The Steiner Wiener k-index or k-center Steiner Wiener indexSWk(&G...

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

5 April 2026

The study of graph connectivity is a central topic in graph theory, with CF-connectedness being a specialized property of interest. A connected graph is CF-connected if, in every optimal drawing, there exists a path between every pair of ve...

(This article belongs to the Special Issue Symmetry in Combinatorics and Discrete Mathematics, 2nd Edition)
  • Article
  • Open Access
1,339 Views
10 Pages

20 August 2026

The study of graph connectedness is a central topic in graph theory, with CF-connectedness being a specialized property of interest. A simple graph is CF-connected if it is connected and, in each of its optimal drawings, any two of its distinct verti...

  • Article
  • Open Access
1 Citations
3,837 Views
9 Pages

17 November 2024

The status (or transmission) of a vertex in a connected graph is the sum of distances between the vertex and all other vertices. The minimum status (or minimum transmission) of a connected graph is the minimum of the statuses of all vertices in the g...

(This article belongs to the Special Issue Advances in Combinatorics, Discrete Mathematics and Graph Theory)
  • Article
  • Open Access
2 Citations
2,307 Views
18 Pages

On a Combinatorial Approach to Studying the Steiner Diameter of a Graph and Its Line Graph

  • Hongfang Liu,
  • Zhizhang Shen,
  • Chenxu Yang and
  • Kinkar Chandra Das

18 October 2022

In 1989, Chartrand, Oellermann, Tian and Zou introduced the Steiner distance for graphs. This is a natural generalization of the classical graph distance concept. Let Γ be a connected graph of order at least 2, and S\V(Γ). Then, the minim...

(This article belongs to the Special Issue Applications of Algebraic Graph Theory and Its Related Topics)
  • Feature Paper
  • Article
  • Open Access
3 Citations
5,532 Views
14 Pages

29 March 2018

A k-colouring of a graph G with colours 1 , 2 , … , k is canonical with respect to an ordering π = v 1 , v 2 , … , v n of the vertices of G if adjacent vertices are assigned different colours and, for 1 ≤ c &l...

(This article belongs to the Special Issue Reconfiguration Problems)
  • Article
  • Open Access
1 Citations
2,264 Views
11 Pages

31 March 2024

The restricted edge-connectivity of a connected graph G, denoted by λ′(G), if it exists, is the minimum cardinality of a set of edges whose deletion makes G disconnected, and each component has at least two vertices. It was proved that &...

(This article belongs to the Special Issue Advances in Graph Theory and Combinatorial Optimization)
  • Article
  • Open Access
3 Citations
3,506 Views
55 Pages

An Index for Graphs and Graph Groupoids

  • Ilwoo Cho and
  • Palle Jorgensen

25 January 2022

In this paper, we consider certain quantities that arise in the images of the so-called graph-tree indexes of graph groupoids. In text, the graph groupoids are induced by connected finite-directed graphs with more than one vertex. If a graph groupoid...

(This article belongs to the Collection Mathematical Analysis and Applications)
  • Article
  • Open Access
2 Citations
1,079 Views
13 Pages

An interconnection network is usually modeled by a graph, and fault tolerance of the interconnection network is often measured by connectivity of the graph. Given a connected subgraph L of a graph G and non-negative integer t, the t-extra connectivit...

  • Article
  • Open Access
13 Citations
2,728 Views
12 Pages

19 September 2022

In this article, we introduce the neighborhood versions of two classical topological indices, namely neighborhood geometric–arithmetic and neighborhood atom bond connectivity indices. We study the graph-theoretic properties of these new topological i...

(This article belongs to the Section Mathematical Analysis)
  • Article
  • Open Access
13 Citations
2,681 Views
12 Pages

On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

  • Maryam Baghipur,
  • Modjtaba Ghorbani,
  • Hilal A. Ganie and
  • Yilun Shang

2 March 2021

The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the...

(This article belongs to the Section A: Algebra and Logic)
  • Article
  • Open Access
2,665 Views
10 Pages

Dual Connectivity in Graphs

  • Mohammed A. Mutar,
  • Daniele Ettore Otera and
  • Hasan A. Khawwan

11 January 2025

An edge-coloring σ of a connected graph G is called rainbow if there exists a rainbow path connecting any pair of vertices. In contrast, σ is monochromatic if there is a monochromatic path between any two vertices. Some graphs can admit a...

(This article belongs to the Special Issue Geometric Topology and Differential Geometry with 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
2 Citations
2,981 Views
14 Pages

25 March 2021

Cicerone and Di Stefano defined and studied the class of k-distance-hereditary graphs, i.e., graphs where the distance in each connected induced subgraph is at most k times the distance in the whole graph. The defined graphs represent a generalizatio...

(This article belongs to the Special Issue Graph Algorithms and Applications)
  • Article
  • Open Access
2 Citations
1,851 Views
10 Pages

17 November 2023

A (2,6)-fullerene F is a 2-connected cubic planar graph whose faces are only 2-length and 6-length. Furthermore, it consists of exactly three 2-length faces by Euler’s formula. The (2,6)-fullerene comes from Došlić’s (k,6)-ful...

(This article belongs to the Section A: Computer Science)
  • Article
  • Open Access
2,187 Views
11 Pages

22 December 2023

This paper introduces the forbidden subgraph conditions for Hamilton-connected graphs. If the degree sequence of the graph is (4,2,2,2,2) and it is connected, then it is called hourglassΓ0. For integers i≥1, the graph Zi is paw, which is obt...

  • Article
  • Open Access
6 Citations
4,920 Views
27 Pages

Counting Hamiltonian Cycles in 2-Tiled Graphs

  • Alen Vegi Kalamar,
  • Tadej Žerak and
  • Drago Bokal

23 March 2021

In 1930, Kuratowski showed that K3,3 and K5 are the only two minor-minimal nonplanar graphs. Robertson and Seymour extended finiteness of the set of forbidden minors for any surface. Širáň and Kochol showed that there are infinitely many k-crossing-c...

  • Article
  • Open Access
1 Citations
2,961 Views
16 Pages

22 January 2024

The vertex quadrangulation QG of a 4-regular graph G visually looks like a graph whose vertices are depicted as empty squares, and the connecting edges are attached to the corners of the squares. In a previous work [JOMC 59, 1551–1569 (2021)],...

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

Uniformly Resolvable Decompositions of Kv-I into n-Cycles and n-Stars, for Even n

  • Giovanni Lo Faro,
  • Salvatore Milici and
  • Antoinette Tripodi

13 October 2020

If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. Given a set Γ of pairwise non-isomorphic graphs, a uniformly resolvable Γ-decomposition of a graph G...

(This article belongs to the Special Issue Advances in Design Theory and Applications in Combinatorial Algebraic Geometry)
  • Article
  • Open Access
2 Citations
1,925 Views
22 Pages

15 December 2024

In this paper, we examine the interplay between the structural and spectral properties of the unit graph G(Zn) for n=p1r1p2r2…pkrk, where p1,p2,…,pk are distinct primes and k,r1,r2,…,rk are positive integers such that at least on...

  • 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
3,185 Views
14 Pages

3 November 2021

Given a connected graph G=(V(G),E(G)), a set S⊆V(G) is said to be a k-metric generator for G if any pair of different vertices in V(G) is distinguished by at least k elements of S. A metric generator of minimum cardinality among all k-metric generato...

(This article belongs to the Special Issue Graphs, Metrics and Models)
  • Article
  • Open Access
1,800 Views
13 Pages

On the Spectral Redundancy of Pineapple Graphs

  • Pawan Kumar,
  • Siddique Merajuddin,
  • Shariefuddin Pirzada and
  • Yilun Shang

26 September 2024

In this article, we explore the concept of spectral redundancy within the class of pineapple graphs, denoted as P(α,β). These graphs are constructed by attaching β pendent edges to a single vertex of a complete graph Kα. A conne...

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

Computing Certain Topological Indices of the Line Graphs of Subdivision Graphs of Some Rooted Product Graphs

  • Adnan Aslam,
  • Muhammad Faisal Nadeem,
  • Zohaib Zahid,
  • Sohail Zafar and
  • Wei Gao

30 April 2019

In this work, we study the degree-based topological invariants, and the general sum-connectivity, A B C 4 , G A 5 , general Zagreb, G A , generalized Randić, and A B C indices of the line graphs of some rooted product...

  • Article
  • Open Access
3 Citations
3,326 Views
8 Pages

The Extendability of Cayley Graphs Generated by Transposition Trees

  • Yongde Feng,
  • Yanting Xie,
  • Fengxia Liu and
  • Shoujun Xu

A connected graph Γ is k-extendable for a positive integer k if every matching M of size k can be extended to a perfect matching. The extendability number of Γ is the maximum k such that Γ is k-extendable. In this paper, we prove th...

(This article belongs to the Special Issue Algebraic Structures and Graph Theory)
  • Article
  • Open Access
14 Citations
4,120 Views
13 Pages

2 June 2021

The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K1,1,3\e obtained by removing one edge e incident with some...

(This article belongs to the Special Issue Algebra and Discrete Mathematics 2020)
  • Article
  • Open Access
2 Citations
2,575 Views
13 Pages

Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs

  • Wahyuni Abidin,
  • Anm Salman and
  • Suhadi Wido Saputro

17 March 2022

Let G be a connected, simple, and finite graph. For an ordered set W={w1,w2,…,wk}⊆V(G) and a vertex v of G, the representation of v with respect to W is the k-vector r(v|W)=(dG(v,w1),…,dG(v,wk)). The set W is called a resolving set...

  • Article
  • Open Access
4 Citations
2,850 Views
12 Pages

On the Diameter and Incidence Energy of Iterated Total Graphs

  • Eber Lenes,
  • Exequiel Mallea-Zepeda,
  • María Robbiano and
  • Jonnathan Rodríguez

2 July 2018

The total graph of G, T(G) is the graph whose vertex set is the union of the sets of vertices and edges of G, where two vertices are adjacent if and only if they stand for either incident or adjacent elements in G. For k≥2, the k-th iterated total...

  • Article
  • Open Access
12 Citations
8,989 Views
22 Pages

Layered Graphs: Applications and Algorithms

  • Bhadrachalam Chitturi,
  • Srijith Balachander,
  • Sandeep Satheesh and
  • Krithic Puthiyoppil

28 June 2018

The computation of distances between strings has applications in molecular biology, music theory and pattern recognition. One such measure, called short reversal distance, has applications in evolutionary distance computation. It has been shown that...

  • Article
  • Open Access
5 Citations
1,260 Views
11 Pages

21 September 2024

Given a graph G=(V(G),V(E)), a non-negative integer g and a set of faulty vertices F⊆V(G), the g-extra connectivity of G, denoted by κg(G), is the smallest cardinality of F, whose value of deletion, if exists, will disconnec...

  • Article
  • Open Access
1,040 Views
11 Pages

16 July 2025

The Nk-index (k-distance degree index) of a connected graph G was first introduced by Naji and Soner as a generalization of the distance degree concept, as Nk(G)=∑k=1d(G)∑v∈V(G)dk(v)k, where the distance between u and v in G is denoted b...

  • Article
  • Open Access
2 Citations
2,209 Views
12 Pages

Extending Ramsey Numbers for Connected Graphs of Size 3

  • Emma Jent,
  • Sawyer Osborn and
  • Ping Zhang

22 August 2024

It is well known that the famous Ramsey number R(K3,K3)=6. That is, the minimum positive integer n for which every red-blue coloring of the edges of the complete graph Kn results in a monochromatic triangle K3 is 6. It is also known that every red-bl...

(This article belongs to the Special Issue Symmetry in Graph Algorithms and Graph Theory III)
  • Article
  • Open Access
88 Citations
4,997 Views
10 Pages

Fractional Metric Dimension of Generalized Jahangir Graph

  • Jia-Bao Liu,
  • Agha Kashif,
  • Tabasam Rashid and
  • Muhammad Javaid

18 January 2019

Arumugam and Mathew [Discret. Math. 2012, 312, 1584–1590] introduced the notion of fractional metric dimension of a connected graph. In this paper, a combinatorial technique is devised to compute it. In addition, using this technique the fracti...

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

3 July 2023

Reducing the number of crossings on graph edges can be useful in various applications, including network visualization, circuit design, graph theory, cartography or social choice theory. This paper aims to determine the crossing number of the join pr...

(This article belongs to the Section B: Geometry and Topology)
  • Article
  • Open Access
11 Citations
2,931 Views
14 Pages

Nordhaus–Gaddum-Type Results for the Steiner Gutman Index of Graphs

  • Zhao Wang,
  • Yaping Mao,
  • Kinkar Chandra Das and
  • Yilun Shang

16 October 2020

Building upon the notion of the Gutman index SGut(G), Mao and Das recently introduced the Steiner Gutman index by incorporating Steiner distance for a connected graph G. The Steiner Gutman k-index SGutk(G) of G is defined by SGutk(G)=∑S⊆V(G)...

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

Uniform (Ck, Pk+1)-Factorizations of Kn − I When k Is Even

  • Giovanni Lo Faro,
  • Salvatore Milici and
  • Antoinette Tripodi

15 March 2022

Let H be a connected subgraph of a graph G. An H-factor of G is a spanning subgraph of G whose components are isomorphic to H. Given a set H of mutually non-isomorphic graphs, a uniform H-factorization of G is a partition of the edges of G into H-fac...

(This article belongs to the Special Issue Hypergroup Theory and Algebrization of Incidence Structures)

of 5