- Article
The half-sunlet graph
The half-sunlet graph
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...
The study of graph connectedness is a central topic in graph theory, with
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
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...
Fix
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
A k-colouring of a graph G with colours is canonical with respect to an ordering of the vertices of G if adjacent vertices are assigned different colours and, for ...
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
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
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...
The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles
A perfect Italian dominating function assigns values in
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...
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...
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...
Let
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 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...
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
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...
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...
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...
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...
The advancement in coloring schemes of graphs is expanding over time to solve emerging problems. Recently, a new form of coloring, namely
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...
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 (...
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...
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...
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...
The vertex quadrangulation
In this paper we study some geometric properties of the algebraic set associated to the binomial edge ideal of a graph. We study the singularity and smoothness of the algebraic set associated to the binomial edge ideal of a graph. Some of these algeb...
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...
The main aim of the paper is to give the crossing number of the join product
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...
The generalized matrix of a graph G is defined as
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...
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...
A total k-rainbow dominating function on a graph
We study locally finite graphs whose normalized adjacency operators belong to the
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...
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
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...
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
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...
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:...
A total perfect Roman dominating function (TPRDF) on a graph
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...
The crossing number
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...
of 2