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