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 2020-03-01 to 2024-03-01.)
ArticleCitations
Varieties of Roman domination II43
Recent developments on the power graph of finite groups – a survey23
Complexity of Roman {2}-domination and the double Roman domination in graphs9
Independent double Roman domination in graphs9
Characterization of classes of graphs with large general position number8
Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks7
A single-source shortest path algorithm for dynamic graphs6
On the eigenvalues of zero-divisor graph associated to finite commutative ring6
On α-adjacency energy of graphs and Zagreb index6
Algorithmic complexity of secure connected domination in graphs5
Wiener index of graphs over rings: a survey5
A survey on pairwise compatibility graphs5
On central max-point-tolerance graphs5
Binding number and path-factor critical deleted graphs5
Double Roman reinforcement number in graphs4
Generalization of MacNeish’s Kronecker product theorem of mutually orthogonal Latin squares4
D-magic strongly regular graphs4
On the planarity, genus and crosscap of new extension of zero-divisor graph of commutative rings4
Antimagic labeling of new classes of trees3
Steiner Wiener index of block graphs3
Decomposition of complete bipartite graphs into cycles and stars with four edges3
Total colorings of some classes of four regular circulant graphs3
On the edge irregular reflexive labeling of corona product of graphs with path3
Fault-tolerant metric dimension of zero-divisor graphs of commutative rings3
The cubic power graph of finite abelian groups3
Domination parameters of generalized Sierpiński graphs3
On the total Roman domination stability in graphs2
Introduction to coalitions in graphs2
Laplacian spectral determination of path-friendship graphs2
On the spread of the geometric-arithmetic matrix of graphs2
On the complexity of some quorum colorings problems of graphs2
On the total and AVD-total coloring of graphs2
Normal 5-edge-colorings of a family of Loupekhine snarks2
On the cozero-divisor graphs associated to rings2
Graphs with equal domination and independent domination numbers2
Doubly semi-equivelar maps on the plane and the torus2
Universal adjacency spectrum of zero divisor graph on the ring and its complement2
Total colorings-a survey2
Further results on independent double roman trees2
Rainbow vertex-connection number on a small-world Farey graph2
Interval edge-coloring: A model of curriculum scheduling2
Secure total domination in chain graphs and cographs2
On inclusive d-distance irregularity strength on triangular ladder graph and path2
Crossing number of Cartesian product of prism and path2
On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths2
OnH-antimagic decomposition of toroidal grids and triangulations1
Power domination in Mycielskian of spiders1
m-Bonacci graceful labeling1
Orientable Zn-distance magic regular graphs1
Asymptotic energy of connected cubic circulant graphs1
Two kinds of conditional connectivity of hypercubes1
Quasi-total Roman bondage number in graphs1
A note on subspace sum graph of vector spaces1
Unitary Cayley graphs whose Roman domination numbers are at most four1
L(1, 2)-labeling numbers on square of cycles1
On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles1
Ideal based hypergraph of a commutative ring1
New results and open problems in line graphs1
On the first Zagreb index of graphs with Self-Loops1
Decomposition of hypercube graphs into paths and cycles of length four1
On strong Skolem starters for ℤpq1
On [k]-Roman domination subdivision number of graphs1
Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties1
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs1
Two extensions of Leech labeling to the class of all graphs1
Graphs with cyclomatic number three having panconnected square, II1
Metric dimension of ideal-intersection graph of the ring Zn1
Decomposition of product graphs into paths and stars on five vertices1
Note on inverse sum indeg index of graphs1
Quasi-total Roman reinforcement in graphs1
A survey and a new class of graceful unicylic graphs1
Total mixed domination in graphs1
Even order uniform hypergraph via the Einstein product1
Complement of the generalized total graph of fields1
Ramsey sequences of graphs1
Some product graphs with power dominating number at most 21
An improved upper bound on the independent double Roman domination number of trees1
On a conjecture concerning total domination subdivision number in graphs1
Critical graphs with Roman domination number four1
Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A1
The spectral determination of the connected multicone graphs1
On minimum revised edge Szeged index of bicyclic graphs1
The k-conversion number of regular graphs1
A property of most of the known non-reconstructible digraphs1
E-super vertex magic labeling of cartoon flowers and wounded flowers1
On graphs with distance Laplacian eigenvalues of multiplicity n −41
Monophonic pebbling number and t-pebbling number of some graphs1
A short note on the left A-Γ-hyperideals in ordered Γ-semihypergroups1
Graph partitioning: an updated survey1
Catlin’s reduced graphs with small orders1
0.035717010498047