AKCE International Journal of Graphs and Combinatorics

Article	Citations
Varieties of Roman domination II	43
Recent developments on the power graph of finite groups – a survey	23
Independent double Roman domination in graphs	9
Complexity of Roman {2}-domination and the double Roman domination in graphs	9
Characterization of classes of graphs with large general position number	8
Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks	7
On α-adjacency energy of graphs and Zagreb index	6
A single-source shortest path algorithm for dynamic graphs	6
On the eigenvalues of zero-divisor graph associated to finite commutative ring	6
Binding number and path-factor critical deleted graphs	5
Algorithmic complexity of secure connected domination in graphs	5
Wiener index of graphs over rings: a survey	5
A survey on pairwise compatibility graphs	5
On central max-point-tolerance graphs	5
On the planarity, genus and crosscap of new extension of zero-divisor graph of commutative rings	4
Double Roman reinforcement number in graphs	4
Generalization of MacNeish’s Kronecker product theorem of mutually orthogonal Latin squares	4
D-magic strongly regular graphs	4
Antimagic labeling of new classes of trees	3
Steiner Wiener index of block graphs	3
Decomposition of complete bipartite graphs into cycles and stars with four edges	3
Total colorings of some classes of four regular circulant graphs	3
On the edge irregular reflexive labeling of corona product of graphs with path	3
Fault-tolerant metric dimension of zero-divisor graphs of commutative rings	3
The cubic power graph of finite abelian groups	3

Domination parameters of generalized Sierpiński graphs	3
Interval edge-coloring: A model of curriculum scheduling	2
Secure total domination in chain graphs and cographs	2
On inclusive d-distance irregularity strength on triangular ladder graph and path	2
Crossing number of Cartesian product of prism and path	2
On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths	2
On the total Roman domination stability in graphs	2
Introduction to coalitions in graphs	2
Laplacian spectral determination of path-friendship graphs	2
On the spread of the geometric-arithmetic matrix of graphs	2
On the complexity of some quorum colorings problems of graphs	2
On the total and AVD-total coloring of graphs	2
Normal 5-edge-colorings of a family of Loupekhine snarks	2
On the cozero-divisor graphs associated to rings	2
Graphs with equal domination and independent domination numbers	2
Doubly semi-equivelar maps on the plane and the torus	2
Universal adjacency spectrum of zero divisor graph on the ring and its complement	2
Total colorings-a survey	2
Further results on independent double roman trees	2
Rainbow vertex-connection number on a small-world Farey graph	2
A property of most of the known non-reconstructible digraphs	1
The k-conversion number of regular graphs	1
E-super vertex magic labeling of cartoon flowers and wounded flowers	1
Monophonic pebbling number and t-pebbling number of some graphs	1
A short note on the left A-Γ-hyperideals in ordered Γ-semihypergroups	1
Graph partitioning: an updated survey	1
Catlin’s reduced graphs with small orders	1
OnH-antimagic decomposition of toroidal grids and triangulations	1
Power domination in Mycielskian of spiders	1
Orientable Zn-distance magic regular graphs	1
m-Bonacci graceful labeling	1
Asymptotic energy of connected cubic circulant graphs	1
Two kinds of conditional connectivity of hypercubes	1
Quasi-total Roman bondage number in graphs	1
A note on subspace sum graph of vector spaces	1
L(1, 2)-labeling numbers on square of cycles	1
Unitary Cayley graphs whose Roman domination numbers are at most four	1
On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles	1
Ideal based hypergraph of a commutative ring	1
New results and open problems in line graphs	1
On the first Zagreb index of graphs with Self-Loops	1
Decomposition of hypercube graphs into paths and cycles of length four	1
On strong Skolem starters for ℤpq	1
On [k]-Roman domination subdivision number of graphs	1
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs	1
Quasi-total Roman reinforcement in graphs	1
Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties	1
Two extensions of Leech labeling to the class of all graphs	1
Graphs with cyclomatic number three having panconnected square, II	1
Metric dimension of ideal-intersection graph of the ring Zn	1

Decomposition of product graphs into paths and stars on five vertices	1
Note on inverse sum indeg index of graphs	1
A survey and a new class of graceful unicylic graphs	1
Total mixed domination in graphs	1
Even order uniform hypergraph via the Einstein product	1
Complement of the generalized total graph of fields	1
Ramsey sequences of graphs	1
Some product graphs with power dominating number at most 2	1
On a conjecture concerning total domination subdivision number in graphs	1
An improved upper bound on the independent double Roman domination number of trees	1
Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A	1
On graphs with distance Laplacian eigenvalues of multiplicity n −4	1
Critical graphs with Roman domination number four	1
The spectral determination of the connected multicone graphs	1
On minimum revised edge Szeged index of bicyclic graphs	1
The minimal and maximal energies of all cubic circulant graphs	0
On the metric dimension of bipartite graphs	0
Number of cycles of small length in a graph	0
Graphs with arbitrarily large adversary degree associated reconstruction number	0
Maximum and minimum values of inverse degree and forgotten indices on the class of all unicyclic graphs	0
Descending endomorphism graphs of groups	0
On characterizing proper max-point-tolerance graphs	0
The k-Ramsey number of two five cycles	0
Graphoidally independent infinite graphs	0
A semi-strong perfect digraph theorem	0
Foreword	0
Signed graphs with integral net Laplacian spectrum	0
Binding number for coprime graph of groups	0
Hop total Roman domination in graphs	0
Reduced non-zero component union graph of free semi-modules	0
Tolerant Radon partitions on the all-paths convexity in graphs	0
The game chromatic number of corona of two graphs	0
On the metric dimension of Cayley graphs	0
Cycle stochastic graphs: Structural and forbidden graph characterizations	0
The crossing number of the generalized Petersen graph P(3k,k) in the projective plane	0
Graceful labeling of digraphs—a survey	0
Euler dynamic H-trails in edge-colored graphs	0
Hitting times for random walks on tricyclic graphs	0
Min-max and max-min graph saturation parameters	0
The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs	0
Factorizations of complete graphs into tadpoles	0
Total resolving number of edge cycle graphs	0
Average distance and connected domination	0
Infinite families of asymmetric graphs	0
Twin g-noncommuting graph of a finite group	0
Gallai-Ramsey number of an 8-cycle	0
On the crossing number for Kronecker product of a tripartite graph with path	0
On eternal domination and Vizing-type inequalities	0
Tight toughness bounds for path-factor critical avoidable graphs	0
Anti-Ramsey theory on complete bipartite graphs	0
Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order	0
Mixed metric dimension over (edge) corona products	0
Eulerian character degree graphs of solvable groups	0
Automorphism groups of the constituent graphs of integral distance graphs	0
On graphoidal length of a tree in terms of its diameter	0
Brief survey on divisor graphs and divisor function graphs	0
On the products of group vertex magic graphs	0
On the maximum spectral radius of multipartite graphs	0
Structural matrices for Signed Petri net	0
Construction of L-equienergetic graphs using some graph operations	0
Linear χ -binding functions for some classes of ( P 3 ∪ P 2 )	0
Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs	0
Integral sum graphs Gn and G-r,n are perfect graphs	0
Power domination in Mycielskians of n -spiders	0
A study of upper ideal relation graphs of rings	0
Independent k-rainbow bondage number of graphs	0
Local edge coloring of graphs	0
Zero-divisor graphs of unitaryR-modules over commutative rings	0
Under which conditions is λ″(G)=κ″(L(G)) ?	0
Existence of 4-factors in star-free graphs with edge-connectivity conditions	0
On regular subgraphs of augmented cubes	0
Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs	0
On the first and second Zagreb indices of some products of signed graphs	0
On balanced cycle domination of graphs	0
An explicit construction of optimal dominating and [1, 2]–dominating sets in grid	0
On the distinguishing chromatic number of the Kronecker products of graphs	0
On the distance spectra ofm-generationn-prism graph	0
Prime labeling in the context of web graphs without center	0
Stress of a graph and its computation	0
Degree associated edge reconstruction number of split graphs with biregular independent set is one	0

Lowell Beineke: five decades of excellence	0
Vertex pancyclicity over lexicographic products	0
End-regularity of generalized bicycle graph	0
On subset labelings of trees	0
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials	0
On the edge chromatic vertex stability number of graphs	0
Total dominator chromatic number of Kneser graphs	0
The cost of edge removal in graph domination	0
The eccentric harmonic index of trees	0
New resolvability parameters of graphs	0
Eulerian and pancyclic zero-divisor graphs of ordered sets	0
Domination number and feedback vertex number of complements of line graphs	0
Metric Dimension of Irregular Convex Triangular Networks	0
Semicomplete absorbent sets in digraphs	0
L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs	0
On [ k ] -Roman domination in graphs	0
On graphs with equal coprime index and clique number	0
Preface	0
Squared distance matrices of trees with matrix weights	0
Selection of activators in finding the burning number	0
Folding trees gracefully	0
Generalized inverses in graph theory	0
Independent 2-point set domination in graphs - II	0
Graphs whose line graphs are ring graphs	0
Truly non-trivial graphoidal graphs	0
Perfect double Italian domination of a graph	0
On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs	0
On the D-differential of a graph	0
First-order logic with metric betweenness – the case of non-definability of some graph classes	0
Wiener index of an ideal-based zero-divisor graph of commutative ring with unity	0
Upper bounds of orders of automorphism groups of leafless metric graphs	0
Relationship between radio k-chromatic number of graphs and square graphs	0
Some results on the existence of Hamiltonian cycles in -compositions of bipartite digraphs	0
A hyperedge coloring and application in combinatorial testing	0
The generalized 3-connectivity of burnt pancake graphs and godan graphs	0
On local distance antimagic labeling of graphs	0
Preface	0
On balanced bipartitions of graphs	0
Complex Hadamard graphs and Butson matrices	0
The connected partition dimension of truncated wheels	0
Independent resolving sets in graphs	0
Some results on one type of graph family with some special number sequences	0
Additively graceful signed graphs	0
Working with Lowell	0
Sudoku number of graphs	0
An algorithm for an ?2-homological test for the planarity of a graph	0
The 6-girth-thickness of the complete graph	0
Induced subgraph and eigenvalues of some signed graphs	0
On the structure of spikes	0
On a function modeling an l-step self avoiding walk	0
On the comaximal graph of a ring	0
Wiener index and addressing of some finite graphs	0
The reflexive edge strength of toroidal fullerene	0
Independent point-set domination in line graphs	0
Broadcast domination of lexicographic and modular products of graphs	0
The matching number and Hamiltonicity of graphs	0
Determinantal properties of Boolean graphs using recursive approach	0
Quasi total double Roman domination in graphs	0
Graphs in which every c edges that form a tree are chords of a common cycle	0
Elementary lift and single element coextension of a binary gammoid	0
Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number	0
An annotated review on graph drawing and its applications	0
Restrained Italian reinforcement number in graphs	0
Extensions of Richardson’s theorem for infinite digraphs and (?, ℬ)-kernels	0
Two inverse eigenvalue problems for matrices whose graphs are trees	0
What can graphs and algebraic structures say to each other?	0
An existence theorem on fractional ID-(g, f)-factor-critical covered graphs	0
Exact square coloring of graphs resulting from some graph operations and products	0
On the necessity of Chvátal’s Hamiltonian degree condition	0
Degree based energy and spectral radius of a graph with self-loops	0
Completely positive graphs and entanglement of quantum states	0