AKCE International Journal of Graphs and Combinatorics

Papers
(The median citation count of AKCE International Journal of Graphs and Combinatorics is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-01-01 to 2026-01-01.)
ArticleCitations
Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A9
Elementary lift and single element coextension of a binary gammoid9
The eccentric harmonic index of trees8
On [k]-Roman domination subdivision number of graphs8
The distance Seidel matrix of connected graphs8
Brief survey on divisor graphs and divisor function graphs7
On the D-differential of a graph7
The dominant strong metric dimension of graphs7
On the minimum reformulated Albertson Index of fixed-order trees and unicyclic graphs with a given maximum degree6
The reflexive edge strength of toroidal fullerene5
Total mixed domination in graphs5
The crossing number of the generalized Petersen graph P(3k,k) in the projective plane5
Doubly semi-equivelar maps on the plane and the torus4
On the comaximal graph of a ring4
On the distinguishing chromatic number of the Kronecker products of graphs4
On estimation of extremal entries of the principal eigenvector of a graph4
Research on student social isolation risk prediction model based on WiFi data and spatiotemporal graph neural network (ST-GCN) fusion4
Determinantal properties of Boolean graphs using recursive approach4
On the maximum atom-bond sum-connectivity index of molecular trees4
Maximum and minimum values of inverse degree and forgotten indices on the class of all unicyclic graphs4
Hitting times for random walks on tricyclic graphs3
Number of cycles of small length in a graph3
On the skewness of the generalized Heawood graphs3
On graphs with distance Laplacian eigenvalues of multiplicity n −43
An annotated review on graph drawing and its applications3
Maximizing vertex rescue: investigating the firefighter problem with edge subdivision2
Wiener index of an ideal-based zero-divisor graph of commutative ring with unity2
Visual system for the evolution of art schools driven by graph neural networks and time series analysis2
The graded annihilating submodule graph2
Further results on outer independent triple Roman domination2
Existence of acyclic matching and Morse complex on transitive digraphs2
Varieties of Roman domination IV2
Independent k -rainbow bondage number of graphs2
Preface2
Power domination in Mycielskians of n -spiders2
Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs2
Average distance and connected domination2
Rainbow vertex-connection number on a small-world Farey graph2
Power domination in Mycielskian of spiders2
Squared distance matrices of trees with matrix weights2
On the first Zagreb index of graphs with Self-Loops2
Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order2
Perfect double Italian domination of a graph2
Graph modeling of bone motion dynamics from thermal imaging and motion capture data2
On minimum revised edge Szeged index of bicyclic graphs2
Unitary Cayley graphs whose Roman domination numbers are at most four2
Stress of a graph and its computation2
Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs1
On the structure of spikes II1
Efficient and secure task scheduling in cloud communication using hybrid convolutional neural network and enhanced encryption techniques1
Decomposition of hypercube graphs into paths and cycles having k edges1
On subset labelings of trees1
Upper bounds of orders of automorphism groups of leafless metric graphs1
Radio labeling of biconvex split graphs1
On the products of group vertex magic graphs1
On the page-number of a circulant graph1
Total dominator chromatic number of Kneser graphs1
An improved upper bound on the independent double Roman domination number of trees1
On the vv-degree based first Zagreb index of graphs1
Characterization of rings with planar, toroidal or projective planar prime ideal sum graphs1
Wiener index of graphs over rings: a survey1
The spectral Turán problem about graphs of given size with forbidden subgraphs1
Face irregular evaluations of family of grids1
Integral sum graphs G n and G -r,n 1
Complex Hadamard graphs and Butson matrices1
Two kinds of conditional connectivity of hypercubes1
Selection of activators in finding the burning number1
Power graphs and a combinatorial property of abundant semigroups1
Tolerant Radon partitions on the all-paths convexity in graphs1
Further study on the second status connectivity index of graphs1
On the planarity, genus and crosscap of new extension of zero-divisor graph of commutative rings1
Truly non-trivial graphoidal graphs1
Graph convolutional network driven 3D sculpture creation space modeling and style similarity evaluation method1
Mixed metric dimension over (edge) corona products1
A -vertex magicness of product of graphs1
Decomposition of hypercube graphs into paths and cycles of length four1
Optimal L (3,2,1)-labeling of trees1
Tight toughness bounds for path-factor critical avoidable graphs1
Quasi-total Roman bondage number in graphs1
On the edge chromatic vertex stability number of graphs1
Collaborative k-means clustering and color transfer algorithm for intelligent color scheme generation in clothing design1
Binding number and path-factor critical deleted graphs1
Domination parameters of generalized Sierpiński graphs1
On the distance spectra ofm-generationn-prism graph1
The k -Ramsey number of two five cycles1
On local distance antimagic labeling of graphs1
On the metric dimension of graphs associated with irreducible and Arf numerical semigroups0
Independent 2-point set domination in graphs with specified girth0
On cyclically 4-connected cubic graphs0
Monophonic pebbling number and t-pebbling number of some graphs0
Two extensions of Leech labeling to the class of all graphs0
Sufficient conditions for the existence of path-factors with given properties0
A property of most of the known non-reconstructible digraphs0
Line graph embedding of co-intersection graph of ideals of commutative rings0
Some complexity results on semipaired domination in graphs0
Twin g-noncommuting graph of a finite group0
A study of upper ideal relation graphs of rings0
On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs0
Binding number for coprime graph of groups0
Graph-based optimization of IoT positioning systems for vehicle path recognition and equipment status analysis0
Exact square coloring of graphs resulting from some graph operations and products0
Zero-divisor graphs of unitaryR-modules over commutative rings0
A hyperedge coloring and application in combinatorial testing0
Randić spectrum of the weakly zero-divisor graph of the ring ℤ n0
Analysis of basketball tactical intent recognition system with collaborative graph convolutional network and spatiotemporal attention mechanism0
Generalized inverses in graph theory0
On balanced cycle domination of graphs0
On [ k ] -Roman domination in graphs0
Quasi-total Roman reinforcement in graphs0
Graph-structured simulation of infrared thermal imaging for load assessment in sports motion analysis0
Descending endomorphism graphs of groups0
On the metric dimension of bipartite graphs0
On game chromatic number of oriented network graphs0
L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs0
Paired coalition in graphs0
Characterizing the forbidden pairs for graphs to be super-edge-connected0
Induced subgraph and eigenvalues of some signed graphs0
On r -factors with components containing specified vertices in a torus0
Sudoku number of graphs0
On characterizing proper max-point-tolerance graphs0
Hop total Roman domination in graphs0
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials0
Vertex pancyclicity over lexicographic products0
The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings0
The generalized 3-connectivity of burnt pancake graphs and godan graphs0
On the determining number of some graphs0
Maximal tree and unicylic graph for Euler Sombor index with given diameter0
Correction0
Quasi total double Roman domination in graphs0
New bounds on Zagreb connection indices for trees with fixed domination number0
Geodetic numbers of tensor product and lexicographic product of graphs0
Covering energy, linear sum and vertical sum of posets0
On the cozero-divisor graphs associated to rings0
Total colorings of some classes of four regular circulant graphs0
Metric Dimension of Irregular Convex Triangular Networks0
Investigating the Metric and Fault-Tolerant Dimensions in Para-Line Network Topologies0
Power graphs of Brandt semigroups0
On the first and second Zagreb indices of some products of signed graphs0
Signed total double Roman dominating functions in graphs0
Non-inclusive diagnosability of alternating group network0
Restrained Italian reinforcement number in graphs0
Two inverse eigenvalue problems for matrices whose graphs are trees0
Linear χ -binding functions for some classes of ( P 3P 2 )0
Containment orders – a lifelong journey0
Multi-threshold crossover tuna swarm optimization (MT-CTSO) segmentation and residual network (RESNET) classifier for maize leaf diseases0
A new method for computing the vertex PI index with applications to special classes of graphs0
Graphs from matrices - a survey0
Chain and threshold hypergraphs0
Under which conditions is λ″(G)=κ″(L(G)) ?0
Additively graceful signed graphs0
On graphs with equal coprime index and clique number0
Completely positive graphs and entanglement of quantum states0
Signed graphs with integral net Laplacian spectrum0
Graph partitioning: an updated survey0
A machine learning approach for epileptic seizure detection using BEMD and long short term memory neural networks0
What can graphs and algebraic structures say to each other?0
The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs0
On the spread of the geometric-arithmetic matrix of graphs0
Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties0
New results and open problems in line graphs0
Further results on independent double roman trees0
Dominating induced matchings and other graph parameters0
Eulerian character degree graphs of solvable groups0
On endomorphism-regularity of ( n , n  + 1)-graphs0
First-order logic with metric betweenness – the case of non-definability of some graph classes0
Independent 2-point set domination in graphs - II0
Degree based energy and spectral radius of a graph with self-loops0
Existence of 4-factors in star-free graphs with edge-connectivity conditions0
Alternative Domination in Graphs0
Reduced non-zero component union graph of free semi-modules0
Component graphs of vector spaces and zero-divisor graphs of ordered sets0
Broadcast domination of lexicographic and modular products of graphs0
Domination number and feedback vertex number of complements of line graphs0
On the metric dimension of Cayley graphs0
Constacyclic codes over ???? q ???????? and their applications0
Euler dynamic H -trails in edge-colored graphs0
Even order uniform hypergraph via the Einstein product0
More results on the signed double Roman domination number of graphs0
Foreword0
Wiener index and addressing of some finite graphs0
A characterization of star-perfect graphs0
Eulerian and pancyclic zero-divisor graphs of ordered sets0
Accuracy analysis of deep learning–driven image recognition through graph models of thermal sensing networks0
Automorphism groups of the constituent graphs of integral distance graphs0
A short note on the left A-Γ-hyperideals in ordered Γ-semihypergroups0
On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups0
Total colorings-a survey0
Optimized energy-aware cluster head selection mechanism for enhancing wireless sensor network lifetime0
Exponential Wiener Index for space vector modulation (SVM)0
Structural matrices for Signed Petri net0
Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number0
0.131511926651