185 hasil
Menampilkan 1–20 · 0,08 detik · RSS
AKCE International Journal of Graphs and Combinatorics, Pp 1-11 (2026)
ISSN 2543-3474 · Taylor & Francis Group · 185 artikel di indeks
-
Artikel Jurnal
Swapped optical transpose interconnection system: Fault-tolerant resolvability on cycle graphs
Within computing and information technology, interconnection systems are often modeled using graphs. A notable example is the swapped Optical Transpose Interconnection System (OTIS). Ensuring resilience to faults is crucial in optoelectronic systems. Across different fault classifications that can…
-
Artikel Jurnal
Quasi total double Roman domination stability in graphs
A quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that [Formula: see text] if [Formula: see text], then the vertex v must have at least two neighbors assigned 2 under f or one neighbor w with…
-
Artikel Jurnal
Varieties of Roman domination IV
Roman domination was introduced in 2004 by Cockayne, Dreyer, Hedetniemi, and Hedetniemi. If [Formula: see text] is the vertex set of a graph G, then a function [Formula: see text] is a Roman dominating function if every vertex [Formula: see text] for which [Formula: see text] is adjacent to at…
-
Artikel Jurnal
Non-inclusive diagnosability of alternating group network
In order to study the fault-tolerant capability of the multiprocessor system, several new self-diagnosis fault-tolerant models are proposed. In particular, non-inclusive diagnosability was showed by Ding et.al. in 2020. The non-inclusive diagnosability of regular graphs with [Formula: see…
-
Artikel Jurnal
Accuracy analysis of deep learning–driven image recognition through graph models of thermal sensing networks
[Abstract] This paper aims to discuss the accuracy analysis of image recognition system based on deep learning algorithm and infrared thermal sensing. This paper expounds the basic principle and implementation of deep learning algorithm, and verifies its effectiveness through a series of…
-
Artikel Jurnal
The dominant strong metric dimension of graphs
Graphs are useful for analyzing the structure models in computer science, operations research, and sociology. Also, different types of graph products have several applications in modeling, including those found in network analysis, communication protocols, organizational structures, diverse fields…
-
Artikel Jurnal
Efficient and secure task scheduling in cloud communication using hybrid convolutional neural network and enhanced encryption techniques
Cloud communication is a combination of distributed computing and parallel computing. Task scheduling is a major challenge in cloud communications due to the NP-completeness of cloud systems. To address this, various swarm intelligence-based approximation techniques have been developed. This paper…
-
Artikel Jurnal
Collaborative k-means clustering and color transfer algorithm for intelligent color scheme generation in clothing design
With the continuous development of computer technology, the field of fashion design increasingly emphasizes intelligence and personalization. A research has proposed an intelligent color scheme generation tool for clothing design based on K-means clustering and color transfer algorithm, aiming to…
-
Artikel Jurnal
Multi-threshold crossover tuna swarm optimization (MT-CTSO) segmentation and residual network (RESNET) classifier for maize leaf diseases
Maize cultivation is frequently affected by diseases, and if they are not promptly prevented and managed, they can lead to reduced yield and quality, resulting in economic losses for farmers. Machine vision technology has been used to identify maize leaf diseases; however, detecting the Region of…
-
Artikel Jurnal
Optimized energy-aware cluster head selection mechanism for enhancing wireless sensor network lifetime
Numerous studies have investigated application-specific clustering strategies for Wireless Sensor Networks (WSNs) to enhance their lifespan. The first WSN clustering method is LEACH. Cluster heads are randomly selected among sensor nodes. Each sensor node selects CHs randomly, depending on its…
-
Artikel Jurnal
Face irregular evaluations of family of grids
Let [Formula: see text] be a connected plane graph. Let [Formula: see text] be a k-labeling where [Formula: see text] and [Formula: see text]. The weight of a face f under ρ is defined as [Formula: see text]. Then ρ is called a face irregular labeling of type [Formula: see text] if [Formula: see…
-
Artikel Jurnal
On estimation of extremal entries of the principal eigenvector of a graph
Let [Formula: see text] be the principal eigenvector corresponding to the spectral radius [Formula: see text] of a graph G of order n. In this paper, we find some bounds on the ratio of the maximal component [Formula: see text] to the minimal component [Formula: see text] of the principal…
-
Artikel Jurnal
On the structure of spikes II
The class spike is an important class of 3-connected matroids. For an integer [Formula: see text], each matroid that is obtained by relaxing one of the circuit-hyperplanes of an r-spike (spike with rank r) is isomorphic to another r-spike and repeating this procedure will produce other r-spikes. So…
-
Artikel Jurnal
Radio labeling of biconvex split graphs
A radio labeling of a graph G is a function [Formula: see text] such that for every pair of distinct vertices [Formula: see text], where diam(G) denotes the diameter of the graph and d(u, v) is the distance between the vertices u and v. The span of a radio labeling f of a graph G is the difference…
-
Artikel Jurnal
Paired coalition in graphs
A paired coalition in a graph [Formula: see text] consists of two disjoint sets of vertices [Formula: see text] and [Formula: see text], neither of which is a paired dominating set but whose union [Formula: see text] is a paired dominating set. A paired coalition partition (abbreviated…
-
Artikel Jurnal
Geodetic numbers of tensor product and lexicographic product of graphs
A shortest [Formula: see text]-[Formula: see text] path between two vertices u and v of a graph G is a [Formula: see text]-[Formula: see text] geodesic of G. Let I[u, v] denote the set of all internal vertices lying on some [Formula: see text]-[Formula: see text] geodesic of G. For a nonempty…
-
Artikel Jurnal
Further results on outer independent triple Roman domination
An outer-independent triple Roman dominating function (OI[3]RDF) on a graph [Formula: see text] is function [Formula: see text] having the property that (i) if [Formula: see text] then v must have either a neighbor assigned 4 or two neighbors one of which is assigned 3 and the other at least 2 or v…
-
Artikel Jurnal
On game chromatic number of oriented network graphs
In this paper, we determine the game chromatic number of oriented honeycomb network graphs and oriented cube connected cycle network graphs.
-
Artikel Jurnal
Covering energy, linear sum and vertical sum of posets
The concept of the covering energy of a poset is known. In this paper, we obtain a relation between the characteristic polynomials of the linear sum of two bounded posets and its components. Also, relations between covering energies of given posets and their linear sum as well as vertical sum are…