Discrete Applied Mathematics

Article	Citations
The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain	48
Path factors in subgraphs	42
A neighborhood union condition for fractional (a	37
A note on fractional ID-[a,b<	35
General properties on Sombor indices	31
A single shuffle is enough for secure card-based computation of any Boolean circuit	31
The generalized 4-connectivity of hierarchical cubic networks	25
Remarks on restricted fractional (g,	24
Binding numbers and restricted fractional (g,	22
A note on domination number in maximal outerplanar graphs	21
Subgraphs with orthogonal factorizations in graphs	20
Open problems on the exponential vertex-degree-based topological indices of graphs	19
The Wiener index of the zero-divisor graph of a finite commutative ring with unity	19
Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs	18
Reliability measure of multiprocessor system based on enhanced hypercubes	18
House of Graphs 2.0: A database of interesting graphs and more	18
The Wiener index of the zero-divisor graph of 18
Semi-online scheduling on two identical machines with a common due date to maximize total early work	18
K1,<	17
The statistical analysis for Sombor indices in a random polygonal chain networks	17
Charging station optimization for balanced electric car sharing	17
The reliability analysis based on the generalized connectivity in balanced hypercubes	17
On the eigenvalues of eccentricity matrix of graphs	16
Note on injective edge-coloring of graphs	15
Vertex-degree based topological indices of digraphs	15

Monitoring the edges of a graph using distances	15
Edge-disjoint paths in faulty augmented cubes	14
On the eccentricity spectra of threshold graphs	14
Mixed metric dimension of graphs with edge disjoint cycles	14
Inequalities between the Kk	13
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem	13
The hexagonal chains with the first three maximal Mostar indices	13
Cluster connectivity of hypercube-based networks under the super fault-tolerance condition	13
Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern	12
Perfect state transfer in NEPS of complete graphs	12
Sylvester power and weighted sums on the Frobenius set in arithmetic progression	12
Fault-tolerant strong Menger (edge) connectivity of arrangement graph	12
A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout	11
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand	11
Maximizing the number of cliques in graphs with given matching number	11
List injective edge-coloring of subcubic graphs	11
A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows	10
Tight isolated toughness bound for fractional (k	10
Two classes of optimal p-ary few-weight codes from down-sets	10
Perfect matching and distance spectral radius in graphs and bipartite graphs	10
Ong-good-neighbor conditional connectivity and diagnosability of hie	10
Investigations on c-boomerang uniformity and perfect nonlinearity	10
The limiting behaviours for the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain	10
Colorings with neighborhood parity condition	10
The h-restricted connectivity of balanced hypercubes	10
Minimum augmented Zagreb index of c-cyclic graphs	10
Unicyclic and bicyclic graphs with maximum exponential second Zagreb index	10
Torus-like graphs and their paired many-to-many disjoint path covers	10
Reliability assessment of the Cayley graph generated by trees	10
Matrix representation of stability definitions in the graph model for conflict resolution with grey-based preferences	10
Sharp upper bounds on the Q-index of (minimally) 2-connected graphs w	9
A note on double domination in graphs	9
On the anti-Ramsey number of forests	9
Homogeneous sets, clique-separators, critical graphs, and optimal χ-b	9
A tree distinguishing polynomial	9
Fibonacci-run graphs I: Basic properties	9
Enumerating connected induced subgraphs: Improved delay and experimental comparison	9
The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions	9
On three outer-independent domination related parameters in graphs	9
Vertex and edge metric dimensions of unicyclic graphs	9
The general position achievement game played on graphs	9
The generalized 4-connectivity of pancake graphs	8
Constructing new families of transmission irregular graphs	8
New lower bounds for the first variable Zagreb index	8
Some spectral inequalities for connected bipartite graphs with maximum	8
A theoretical investigation on the distinguishers of Salsa and ChaCha	8
Remarks on odd colorings of graphs	8
Computing graph gonality is hard	8
Random walks and Laplacians on hypergraphs: When do they match?	8
On simplified NP-complete variants of Monotone 3 -Sat	8

Feedback edge sets in temporal graphs	8
Injective coloring of some subclasses of bipartite graphs and chordal graphs	8
Symmetric property and reliability of locally twisted cubes	8
General Randić index of unicyclic graphs with given diameter	8
The (degree-) Kirchhoff indices in random polygonal chains	8
Finding densest k-connected subgraphs	8
On the distance-edge-monitoring numbers of graphs	8
A new approach to finding the extra connectivity of graphs	7
A note on odd colorings of 1-planar graphs	7
Efficient enumeration of maximal induced bicliques	7
Extremal results for graphs of bounded metric dimension	7
The number of subtrees in graphs with given number of cut edges	7
Vertex and edge metric dimensions of cacti	7
Integer k-matchings of graphs: 7
Decomposition of planar graphs with forbidden configurations	7
Unified extremal results for k-apex unicyclic graphs (trees)	7
Several classes of PcN power functions over finite fields	7
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods	7
Structurally parameterized d-scattered set	7
Graphs G with nullity 7
Vectorial bent functions weakly/strongly outside the completed Maiorana–McFarland class	7
Antimagic orientation of lobsters	7
On the weightwise nonlinearity of weightwise perfectly balanced functions	7
Graphr-hued colorings—A survey	7
Unicyclic graphs with extremal values of arithmetic–geometric index	7
Erdös–Gallai-type problems for distance-edge-monitoring numbers	7
Fair multi-cake cutting	7
Monochromatic disconnection of graphs	7
An O∗	7
Exact square coloring of subcubic planar graphs	7
The co-secure domination in proper interval graphs	7
Weak degeneracy of planar graphs without 4- and 6-cycles	7
Extremal vertex-degree function index for trees and unicyclic graphs with given independence number	7
Monitoring edge-geodetic sets: Hardness and graph products	6
Reliability assessment for modified bubble-sort networks	6
Multiplicative version of eccentric connectivity index	6
On the Kirchhoff index of a graph and the matchings of the subdivision	6
On the eccentric connectivity index of uniform hypergraphs	6
The expected values of Wiener indices in random polycyclic chains	6
On the packing chromatic number of Moore graphs	6
Some results on k-critical 6
The iterated local transitivity model for hypergraphs	6
The 3-path-connectivity of the hypercubes	6
Revising Johnson’s table for the 21st century	6
Construction of weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables	6
Resistance distance and Kirchhoff index in dihedral Cayley graphs	6
Sharp bounds on the Arithmetic–geometric index of graphs and line graphs	6
New bounds for perfect k-hashing	6
The eccentricity matrix of a digraph	6
The 3-extra conditional diagnosability of balanced hypercubes under MM	6
Investigating the recoverable robust single machine scheduling problem under interval uncertainty	6
Algorithmic techniques for finding resistance distances on structured graphs	6
General sum-connectivity index of unicyclic graphs with given diameter	6
Strongly separable matrices for nonadaptive combinatorial group testing	6
New bounds on the double domination number of trees	6
Improved sufficient conditions for k-leaf-connected graphs	6
Neighbor connectivity of pancake graphs and burnt pancake graphs	6
Minimum Spanning Tree Cycle Intersection problem	6
Constructions of (vectorial) bent functions outside the completed Maiorana–McFarland class	6
Second-order productivity, second-order payoffs, and the Shapley value	6
On the complexity of min–max–min robustness with two alternatives and budgeted uncertainty	6
A faster FPTAS for knapsack problem with cardinality constraint	6
On the robustness of the metric dimension of grid graphs to adding a single edge	6
Mixing time of the switch Markov chain and stable degree sequences	6
New comments on “A Hamilton sufficient condition for completely independent spanning tree”	6
Dominating sets reconfiguration under token sliding	6
The spanning cyclability of Cayley graphs generated by transposition trees	6
On card guessing game with one time riffle shuffle and complete feedback	6
A note onk-metric dimensional graphs	6
Laplacian state transfer in edge complemented coronas	6
Improved descriptional complexity results on generalized forbidding grammars	6
Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs	6
Positive semidefiniteness of A	6
Stability factor for robust balancing of simple assembly lines under uncertainty	6
Extreme Wiener indices of trees with given number of vertices of maximum degree	6
A symmetry-free polynomial formulation of the capacitated vehicle routing problem	6
The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains	6
Truncated metric dimension for finite graphs	6
From modular decomposition trees to rooted median graphs	5
Packing (1,1	5

On the algebraic immunity of direct sum constructions	5
A note on eigenvalue, spectral radius and energy of extended adjacency matrix	5
On general ABC	5
Harmonic index of a line graph	5
LP-based dual bounds for the maximum quasi-clique problem	5
Critical (P5	5
Note on Sombor index of connected graphs with given degree sequence	5
Antimagic labeling of forests with sets of consecutive integers	5
Injective edge coloring of graphs with maximum degree 5	5
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter	5
A polyhedral model for enumeration and optimization over the set of circuits	5
New results for the Mondrian art problem	5
Maximum induced forests in random graphs	5
On null 3-hypergraphs	5
Fibonacci-run graphs II: Degree sequences	5
On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision	5
Facets and facet subgraphs of symmetric edge polytopes	5
Effective resistances and spanning trees in the complete bipartite graph plus a matching	5
Compatibility of partitions with trees, hierarchies, and split systems	5
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes	5
Thinness of product graphs	5
An improved approximation for Maximum k-dependent Set on bipartite g	5
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity	5
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design	5
Variations of largest rectangle recognition amidst a bichromatic point set	5
Italian domination of Cartesian products of directed cycles	5
DP-3-coloring of planar graphs without certain cycles	5
Hardness and efficiency on t-admissibility for graph operations	5
Extremal problems on distance spectra of graphs	5
Algebraic degree of spectra of Cayley hypergraphs	5
Characterizing the fullerene graphs with the minimum forcing number 3	5
Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges	5
Counting phylogenetic networks with few reticulation vertices: A second approach	5
Reducing the domination number of (P	5
On the balanceability of some graph classes	5
Super connectivity of folded twisted crossed cubes	5
On the (signless Laplacian) spectral radius of minimally k-(edge)-con	5
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees	5
Extremal problems on the Atom-bond sum-connectivity indices of trees with given matching number or domination number	5
A note on 1-planar graphs with minimum degree 7	4
Antimagic orientations of graphs with given independence number	4
A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem	4
On list 3-dynamic coloring of near-triangulations	4
Cooperative games on simplicial complexes	4
Detecting and enumerating small induced subgraphs in c-closed graph	4
The greatest values for atom-bond sum-connectivity index of graphs with given parameters	4
On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions	4
Isolation of connected graphs	4
A systematic method of constructing weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables	4
Perfect Italian domination in graphs: Complexity and algorithms	4
Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model	4
On graphs whose eternal vertex cover number and vertex cover number coincide	4
The Turán number of the square of a path	4
A 2/3-approximation algorithm for vertex-weighted matching	4
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules	4
Saturation numbers for tP	4
Global triple Roman dominating function	4
Compositions, decompositions, and conformability for total coloring on power of cycle graphs	4
Cryptanalysis of stream cipher LIZARD using division property and MILP based cube attack	4
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection	4
Wiener index of quadrangulation graphs	4
Generating irreducible copositive matrices using the stable set problem	4
Characterizing extremal graphs for open neighbourhood location-domination	4
Mixed integer formulations using natural variables for single machine scheduling around a common due date	4
Comparing Wiener complexity with eccentric complexity	4
On the resistance diameters of graphs and their line graphs	4
On the generating functions and special functions associated with superoscillations	4
On the scramble number of graphs	4
Edge metric dimension and mixed metric dimension of planar graph Q	4
P5	4
Parameterized and exact algorithms for class domination coloring	4
On the Colijn–Plazzotta numbering scheme for unlabeled binary rooted trees	4
Axiomatic characterization of the interval function of a bipartite graph	4
A new approach on locally checkable problems	4
Vertex-edge domination in unit disk graphs	4
Restricted connectivity of Cayley graph generated by transposition trees	4
On two problems related to anti-adjacency (eccentricity) matrix	4
The power graph of a torsion-free group determines the directed power graph	4
The micro-world of cographs	4
Forbidden subgraphs for supereulerian and hamiltonian graphs	4
Induced star partition of graphs	4
Vertex-critical (P	4
Polyhedral properties of the induced cluster subgraphs	4
On the semi-proper orientations of graphs	4
S-packing colorings of distance graphs 4
On the foundations and extremal structure of the holographic entropy cone	4
New Steiner 2-designs from old ones by paramodifications	4
On a conjecture of Schweser and Stiebitz	4
Sufficient conditions for k-leaf-connected graphs in terms of the fir	4
A note on the packing chromatic number of lexicographic products	4
Optimization over degree sequences of graphs	4
A note on generic rigidity of graphs in higher dimension	4
The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11	4
Proof of a conjecture on the Wiener index of Eulerian graphs	4
Some sufficient conditions for graphs to be k-leaf-connected	4