| Uniquely identifying the edges of a graph: The edge metric dimension |
17 |
| The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes |
10 |
| On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs |
10 |
| Some bounds on the zero forcing number of a graph |
9 |
| Double Roman domination number |
8 |
| Resistance distance in straight linear 2-trees |
8 |
| Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm |
8 |
| On eccentric distance sum and degree distance of graphs |
8 |
| Nearly optimal codebooks based on generalized Jacobi sums |
7 |
| On the difference between the (revised) Szeged index and the Wiener index of cacti |
7 |
| Neighbor sum distinguishing total coloring of sparse IC-planar graphs |
7 |
| On graphs with the maximum edge metric dimension |
7 |
| Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index |
7 |
| Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices |
7 |
| Conditional connectivity of folded hypercubes |
7 |
| On 2-rainbow domination of generalized Petersen graphs |
6 |
| The strong metric dimension of the power graph of a finite group |
6 |
| Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring |
6 |
| On the Bruhat order of labeled graphs |
6 |
| Total Roman domination in the lexicographic product of graphs |
6 |
| Scheduling cooperative gantry cranes with seaside and landside jobs |
6 |
| Perfect Roman domination in trees |
6 |
| Independent Roman {2}-domination in graphs |
6 |
| Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks |
6 |
| General multiplicative Zagreb indices of trees |
5 |
| On the chromatic numbers of small-dimensional Euclidean spaces |
5 |
| On the minimal eccentric connectivity indices of bipartite graphs with some given parameters |
5 |
| Solving the single crane scheduling problem at rail transshipment yards |
5 |
| H-colouring P-t-free graphs in subexponential time |
5 |
| An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services |
5 |
| Graphs with maximal sigma irregularity |
5 |
| A lower bound on the zero forcing number |
5 |
| Elementary matrix equivalence and core transformation graphs for Parikh matrices |
5 |
| Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs |
5 |
| On conflict-free connection of graphs |
5 |
| New combinatorial interpretations of r-Whitney and r-Whitney-Lah numbers |
5 |
| On the packing chromatic number of subcubic outerplanar graphs |
5 |
| Throttling positive semidefinite zero forcing propagation time on graphs |
5 |
| Robust scheduling with budgeted uncertainty |
5 |
| Boundary enumerator polynomial of hypercubes in Fibonacci cubes |
5 |
| On the semitotal domination number of line graphs |
5 |
| Fairly allocating contiguous blocks of indivisible items |
5 |
| Two kinds of generalized connectivity of dual cubes |
5 |
| Dynamic coloring parameters for graphs with given genus |
4 |
| The anti-adjacency matrix of a graph: Eccentricity matrix |
4 |
| Rainbow spanning trees in properly coloured complete graphs |
4 |
| Rethinking structural balance in signed social networks |
4 |
| Minimal NMR distance information for rigidity of protein graphs |
4 |
| Bounds on the burning number |
4 |
| On the total forcing number of a graph |
4 |
