AKCE International Journal of Graphs and Combinatorics

Papers
(The TQCC of AKCE International Journal of Graphs and Combinatorics is 1. 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 2021-05-01 to 2025-05-01.)
ArticleCitations
Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A42
Elementary lift and single element coextension of a binary gammoid8
On the total Roman domination stability in graphs7
The eccentric harmonic index of trees6
The distance Seidel matrix of connected graphs6
On the minimum reformulated Albertson Index of fixed-order trees and unicyclic graphs with a given maximum degree5
Brief survey on divisor graphs and divisor function graphs5
On [k]-Roman domination subdivision number of graphs5
On the comaximal graph of a ring4
On the D-differential of a graph4
The crossing number of the generalized Petersen graph P(3k,k) in the projective plane4
Total mixed domination in graphs4
Determinantal properties of Boolean graphs using recursive approach4
Doubly semi-equivelar maps on the plane and the torus3
On the maximum atom-bond sum-connectivity index of molecular trees3
On estimation of extremal entries of the principal eigenvector of a graph3
Maximum and minimum values of inverse degree and forgotten indices on the class of all unicyclic graphs3
The reflexive edge strength of toroidal fullerene3
Double Roman reinforcement number in graphs2
Number of cycles of small length in a graph2
Unitary Cayley graphs whose Roman domination numbers are at most four2
Wiener index of an ideal-based zero-divisor graph of commutative ring with unity2
On the distinguishing chromatic number of the Kronecker products of graphs2
On the skewness of the generalized Heawood graphs2
Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order2
Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs2
The graded annihilating submodule graph2
Further results on outer independent triple Roman domination2
Hitting times for random walks on tricyclic graphs2
On graphs with distance Laplacian eigenvalues of multiplicity n −42
Average distance and connected domination2
On minimum revised edge Szeged index of bicyclic graphs2
An annotated review on graph drawing and its applications2
Power domination in Mycielskian of spiders1
Existence of acyclic matching and Morse complex on transitive digraphs1
On the page-number of a circulant graph1
Decomposition of hypercube graphs into paths and cycles having k edges1
On the vv-degree based first Zagreb index of graphs1
The connected partition dimension of truncated wheels1
Tight toughness bounds for path-factor critical avoidable graphs1
Total dominator chromatic number of Kneser graphs1
The minimal and maximal energies of all cubic circulant graphs1
Complex Hadamard graphs and Butson matrices1
Truly non-trivial graphoidal graphs1
Squared distance matrices of trees with matrix weights1
Further study on the second status connectivity index of graphs1
Stress of a graph and its computation1
On a conjecture concerning total domination subdivision number in graphs1
Power domination in Mycielskians of n -spiders1
Maximizing vertex rescue: investigating the firefighter problem with edge subdivision1
Domination parameters of generalized Sierpiński graphs1
Upper bounds of orders of automorphism groups of leafless metric graphs1
An improved upper bound on the independent double Roman domination number of trees1
Independent point-set domination in line graphs1
Binding number and path-factor critical deleted graphs1
Generalization of MacNeish’s Kronecker product theorem of mutually orthogonal Latin squares1
On the first Zagreb index of graphs with Self-Loops1
On the planarity, genus and crosscap of new extension of zero-divisor graph of commutative rings1
Preface1
Graphoidally independent infinite graphs1
Rainbow vertex-connection number on a small-world Farey graph1
Perfect double Italian domination of a graph1
Tolerant Radon partitions on the all-paths convexity in graphs1
The k -Ramsey number of two five cycles1
On local distance antimagic labeling of graphs1
Quasi-total Roman bondage number in graphs1
On the products of group vertex magic graphs1
On the distance spectra ofm-generationn-prism graph1
Selection of activators in finding the burning number1
Independent k -rainbow bondage number of graphs1
Integral sum graphs G n and G -r,n 1
Relationship between radio k-chromatic number of graphs and square graphs1
0.13410520553589