Skip to Content

77 Results Found

  • Article
  • Open Access
1 Citations
390 Views
34 Pages

15 September 2026

The half-sunlet graph HS3k is a 2k-cycle with a pendant edge at every alternate vertex (|V|=|E|=3k). We give a complete decomposition theory for HS12 (k=4), characterising when HS12 decomposes G for G complete, complete bipartite,...

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

2 December 2024

The threshold protocol game is a graphical game that models the adoption of an idea or product through a population. There are two states players may take in the game, and the goal of the game is to motivate the state that begins in the minority to s...

  • 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
664 Views
14 Pages

17 December 2025

Let G be a simple graph. A general total coloring f of G refers to a coloring of the vertices and edges of G. Let C(x) be the set of colors of vertex x and edges incident with x under f. For a general total coloring f of G in which k colors are avail...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
338 Views
16 Pages

Distance Magic Labelings of Complete Bipartite Graphs Obtained by Partition Modification

  • Kaveesha V. Senarathna,
  • Sujeeva Wijesiri and
  • Shamon Almeida

7 September 2026

Graph labeling is an important area of graph theory that studies the assignment of integers to the vertices or edges of a graph according to specific rules. Among these labeling methods, distance magic labeling has attracted considerable attention du...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
1,173 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
2 Citations
2,775 Views
19 Pages

On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs

  • Ahmed El-Mesady,
  • Tasneem Farahat,
  • Ramadan El-Shanawany and
  • Aleksandr Y. Romanov

29 June 2023

Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications. The orthogonal double cover (ODC) is a branch of graph theory and is co...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • 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
2,997 Views
9 Pages

The Strong Equitable Vertex 1-Arboricity of Complete Bipartite Graphs and Balanced Complete k-Partite Graphs

  • Janejira Laomala,
  • Keaitsuda Maneeruk Nakprasit,
  • Kittikorn Nakprasit and
  • Watcharintorn Ruksasakchai

31 January 2022

An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two color classes differ by at most one. An equitable (q,r)-tree-coloring of a graph G is an equitable q-coloring of G such that the subgraph induced by each...

(This article belongs to the Special Issue Graph Theory and Its Applications)
  • Article
  • Open Access
2,597 Views
13 Pages

A Complete Characterization of Bipartite Graphs with Given Diameter in Terms of the Inverse Sum Indeg Index

  • Guifu Su,
  • Guanbang Song,
  • Junfeng Du,
  • Weixing Yang and ,
  • Gang Rao and
  • Jun Yin
  • + 1 author+ 0 author

2 December 2022

In 2010, Vukičević introduced an new graph invariant, the inverse sum indeg index of a graph, which has been studied due to its wide range of applications. Let Bnd be the class of bipartite graphs of order n and diameter d. In this paper, w...

(This article belongs to the Special Issue Recent Advances in Graph Theory with Applications)
  • Article
  • Open Access
575 Views
39 Pages

4 June 2026

Calculating the number of spanning trees in a graph is a crucial problem in combinatorics and physics that has been thoroughly researched for many years by mathematicians and physicists. The higher the quality and perfection of the network, the great...

(This article belongs to the Special Issue Advances in Combinatorics, Discrete Mathematics and Graph Theory, 2nd Edition)
  • Article
  • Open Access
16 Citations
6,308 Views
15 Pages

17 September 2018

The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtaine...

(This article belongs to the Special Issue Reconfiguration Problems)
  • Article
  • Open Access
372 Views
26 Pages

Perfect Italian Domination on Structured Bipartite Graphs: Algorithms, Parameterization, and Hardness

  • Renjith Pazhaniappan,
  • Manjusha Mohandas Sathi and
  • Manikandan Vazhora Malayil

17 September 2026

A perfect Italian dominating function assigns values in {0,1,2} to the vertices of a graph so that every zero-valued vertex has a neighbor-value sum of exactly two. We determine the computational complexity of the problem for bipartite graphs whose n...

  • Article
  • Open Access
9 Citations
5,301 Views
19 Pages

5 May 2023

In soccer, quantitatively evaluating the performance of players and teams is essential to improve tactical coaching and players’ decision-making abilities. To achieve this, some methods use predicted probabilities of shoot event occurrences to...

(This article belongs to the Section Sensing and Imaging)
  • Article
  • Open Access
5 Citations
2,883 Views
17 Pages

23 April 2025

Quantum walks are a powerful framework for simulating complex quantum systems and designing quantum algorithms, particularly for spatial search on graphs, where the goal is to find a marked vertex efficiently. In this work, we present efficient quant...

(This article belongs to the Special Issue Quantum Walks for Quantum Technologies)
  • Article
  • Open Access
29 Citations
5,806 Views
20 Pages

A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications

  • Liangsong Huang,
  • Yu Hu,
  • Yuxia Li,
  • P. K. Kishore Kumar and ,
  • Dipak Koley and
  • Arindam Dey
  • + 1 author+ 0 author

17 June 2019

Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those p...

(This article belongs to the Special Issue Graph-Theoretic Problems and Their New Applications)
  • Article
  • Open Access

17 November 2026

Let R=A×B be a direct product of nonzero finite commutative rings with identity. We compare the classical zero-divisor graph Γ(R), the annihilator graph AG(R), and a principal-ideal–annihilator intersection graph Γ¯(R), e...

(This article belongs to the Special Issue Advances in Graph Theory and Its Application)
  • Article
  • Open Access
2,044 Views
14 Pages

24 July 2023

In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single...

(This article belongs to the Special Issue Advances of Computer Algorithms and Data Structures)
  • Article
  • Open Access
7 Citations
3,178 Views
20 Pages

Efficient Graph Algorithms in Securing Communication Networks

  • Syed Ahtsham Ul Haq Bokhary,
  • Athar Kharal,
  • Fathia M. Al Samman,
  • Mhassen. E. E. Dalam and
  • Ameni Gargouri

26 September 2024

This paper presents three novel encryption and decryption schemes based on graph theory that aim to improve security and error resistance in communication networks. The novelty of this work lies in the application of complete bipartite graphs in two...

(This article belongs to the Special Issue Symmetry and Graph Theory, 2nd Edition)
  • Article
  • Open Access
2,193 Views
6 Pages

14 October 2020

An equitable partition of a graph G is a partition of the vertex set of G such that the sizes of any two parts differ by at most one. The strong equitable vertexk-arboricity of G, denoted by vak≡(G), is the smallest integer t such that G can be...

(This article belongs to the Section C2: Dynamical Systems)
  • 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
9 Citations
4,123 Views
19 Pages

30 November 2020

With users being exposed to the growing volume of online information, the recommendation system aiming at mining the important or interesting information is becoming a modern research topic. One approach of recommendation is to integrate the graph ne...

(This article belongs to the Special Issue Multivariable Optimization by Intelligent and Numerical Modelling and Simulation)
  • Article
  • Open Access
2,300 Views
14 Pages

Star Bicolouring of Bipartite Graphs

  • Daya Gaur,
  • Shahadat Hossain and
  • Rishi Ranjan Singh

24 August 2024

We give an integer linear program formulation for the star bicolouring of bipartite graphs. We develop a column generation method to solve the linear programming relaxation to obtain a lower bound for the minimum number of colours needed. We determin...

(This article belongs to the Collection Feature Papers in Combinatorial Optimization, Graph, and Network Algorithms)
  • Feature Paper
  • Article
  • Open Access
1,489 Views
17 Pages

5 September 2025

We study the line graphs of bipartite multigraphs, which naturally arise in combinatorics, game theory, and applications such as scheduling and motion planning. We introduce a new characterization of these graphs via valid partial assignments of the...

(This article belongs to the Special Issue New Perspectives of Graph Theory and Combinatorics)
  • Article
  • Open Access
5,304 Views
15 Pages

On the P3-Coloring of Bipartite Graphs

  • Zemiao Dai,
  • Muhammad Naeem,
  • Zainab Shafaqat,
  • Manzoor Ahmad Zahid and
  • Shahid Qaisar

12 August 2023

The advancement in coloring schemes of graphs is expanding over time to solve emerging problems. Recently, a new form of coloring, namely P3-coloring, was introduced. A simple graph is called a P3-colorable graph if its vertices can be colored so tha...

(This article belongs to the Section B: Geometry and Topology)
  • Article
  • Open Access
759 Views
25 Pages

14 May 2026

The diminished Sombor index is a degree-based topological index that normalizes the Sombor contribution of each edge (defined as the Euclidean norm of the endpoint degrees) by the sum of those degrees, thereby making the index independent of graph si...

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

12 June 2018

Covering the edges of a bipartite graph by a minimum set of bipartite complete graphs (bicliques) is a basic graph theoretic problem, with numerous applications. In particular, it is used to characterize parsimonious models of a set of observations (...

(This article belongs to the Special Issue Algorithms for Hard Problems: Approximation and Parameterization)
  • Feature Paper
  • Article
  • Open Access
3 Citations
2,752 Views
16 Pages

On the Graph Isomorphism Completeness of Directed and Multidirected Graphs

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

11 January 2025

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

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

25 May 2022

Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimensio...

(This article belongs to the Special Issue Graph Theory and Applications)
  • Article
  • Open Access
382 Views
14 Pages

1 September 2026

A graph is called H-free if the graph has no subgraph being isomorphic to H. The classical Turán problem aims to determine the maximum size of an H-free graph with given order. In 2010, Nikiforov introduced the spectral Turán-type probl...

  • 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
395 Views
32 Pages

Strong Edge-Based Roman Domination in Fuzzy Graphs

  • Juan C. Valenzuela-Tripodoro,
  • Pedro García-Vázquez and
  • Martín Cera López

28 August 2026

This work is related to the extension of the well-known problem of Roman domination in graph theory to fuzzy graphs. A variety of approaches have been used to explore the concept of domination in fuzzy graphs. This study uses the concept of strong do...

(This article belongs to the Section B: Mathematics)
  • 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
6 Citations
3,396 Views
15 Pages

Knowledge Graph Recommendation Model Based on Feature Space Fusion

  • Suqi Zhang,
  • Xinxin Wang,
  • Rui Wang,
  • Junhua Gu and
  • Jianxin Li

31 August 2022

The existing recommendation model based on a knowledge graph simply integrates the behavior features in a user–item bipartite graph and the content features in a knowledge graph. However, the difference between the two feature spaces is ignored...

(This article belongs to the Special Issue Recent Analysis and Applications of Algorithms, Programs and Data Based on Artificial Intelligence)
  • Article
  • Open Access
1,768 Views
11 Pages

21 February 2025

The generalized matrix of a graph G is defined as M(G)=A(G)−tD(G) (t∈R, and A(G) and D(G), respectively, denote the adjacency matrix and the degree matrix of G), and the generalized characteristic polynomial of G is merely the characterist...

(This article belongs to the Special Issue Advances in Graph Theory Ⅱ)
  • Article
  • Open Access
7 Citations
5,809 Views
20 Pages

31 October 2021

NP-complete problems in graphs, such as enumeration and the selection of subgraphs with given characteristics, become especially relevant for large graphs and networks. Herein, particular statements with constraints are proposed to solve such problem...

(This article belongs to the Special Issue New Trends in Graph and Complexity Based Data Analysis and Processing)
  • Article
  • Open Access
50 Views
13 Pages

Cordial Labeling of Mycielskian Graphs

  • Soundar Rajan Somasundaram and
  • Baskar Babujee Jayapal

7 November 2026

Cordial labeling is a well-established graph labeling scheme with rich combinatorial properties and significant applications in graph theory. In this paper, we investigate the existence of cordial labelings for the mycielskian of trees, cycles, compl...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
3 Citations
4,240 Views
16 Pages

18 May 2024

In this paper, we study the knapsack problem with conflict pair constraints. After a thorough literature survey on the topic, our study focuses on the special case of bipartite conflict graphs. For complete bipartite (multipartite) conflict graphs, t...

(This article belongs to the Special Issue 2024 and 2025 Selected Papers from Algorithms Editorial Board Members)
  • Feature Paper
  • Article
  • Open Access
5 Citations
5,655 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
6 Citations
3,054 Views
17 Pages

On Topologies on Simple Graphs and Their Applications in Radar Chart Methods

  • Husniyah Alzubaidi,
  • Ljubiša D. R. Kočinac and
  • Hakeem A. Othman

28 February 2025

This paper introduces a novel topology (upper approximated G-topology) on vertex sets of graphs using rough upper approximation neighborhoods, extending prior work on graph-induced topologies. Key results include characterizing discrete/indiscrete to...

(This article belongs to the Section Geometry and Topology)
  • Article
  • Open Access
981 Views
11 Pages

18 December 2025

There are several graphs naturally associated with rings. The unitary Cayley graph of a ring R is the graph with vertex set R, where two elements x,y∈R are adjacent if and only if x−y is a unit of R. We show that the unitary Cayley graph C...

(This article belongs to the Special Issue Symmetry in Numerical Analysis and Applied Mathematics)
  • Article
  • Open Access
44 Citations
3,936 Views
12 Pages

On a Graph Associated to UP-Algebras

  • Moin A. Ansari,
  • Azeem Haidar and
  • Ali N.A. Koam

In this article, we introduce the concept of graphs associated with commutative UP-algebra, which we say is a UP-graph whose vertices are the elements of commutative UP-algebra and whose edges are the association of two vertices, that is two elements...

  • Article
  • Open Access
11 Citations
6,563 Views
30 Pages

A Coarse-to-Fine Registration Approach for Point Cloud Data with Bipartite Graph Structure

  • Munan Yuan,
  • Xiru Li,
  • Longle Cheng,
  • Xiaofeng Li and
  • Haibo Tan

Alignment is a critical aspect of point cloud data (PCD) processing, and we propose a coarse-to-fine registration method based on bipartite graph matching in this paper. After data pre-processing, the registration progress can be detailed as follows:...

(This article belongs to the Section Computer Science & Engineering)
  • Article
  • Open Access
4 Citations
2,288 Views
15 Pages

31 August 2023

A total perfect Roman dominating function (TPRDF) on a graph G=(V,E) is a function f from V to {0,1,2} satisfying (i) every vertex v with f(v)=0 is a neighbor of exactly one vertex u with f(u)=2; in addition, (ii) the subgraph of G that is induced by...

(This article belongs to the Special Issue Symmetry and Graph Theory)
  • Article
  • Open Access
3 Citations
2,443 Views
26 Pages

14 December 2024

Perfect Roman Dominating Functions and Unique Response Roman Dominating Functions are two ways to translate perfect code into the framework of Roman Dominating Functions. We also consider the enumeration of minimal Perfect Roman Dominating Functions...

(This article belongs to the Special Issue Selected Algorithmic Papers from IWOCA 2024)
  • Article
  • Open Access
15 Citations
4,339 Views
9 Pages

The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete...

(This article belongs to the Special Issue Advances and Novel Approaches in Discrete Optimization)
  • Article
  • Open Access
1 Citations
500 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)

of 2