Discrete Applied Mathematics

Article	Citations
The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain	48
Path factors in subgraphs	36
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs	36
A note on fractional ID-[a,b<	34
General properties on Sombor indices	31
Spectral properties of the eccentricity matrix of graphs	30
The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain	30
A neighborhood union condition for fractional (a	28
A single shuffle is enough for secure card-based computation of any Boolean circuit	26
Structure connectivity and substructure connectivity of star graphs	24
Spectra of eccentricity matrices of graphs	23
Partial domination of maximal outerplanar graphs	23
The expected subtree number index in random polyphenylene and spiro chains	22
Binding numbers and restricted fractional (g,	22
Metric dimension and pattern avoidance in graphs	22
A note on domination number in maximal outerplanar graphs	21
Subgraphs with orthogonal factorizations in graphs	20
General eccentric connectivity index of trees and unicyclic graphs	19
The generalized 4-connectivity of hierarchical cubic networks	19
Semi-online scheduling on two identical machines with a common due date to maximize total early work	18
On energy and Laplacian energy of chain graphs	18
Remarks on restricted fractional (g,	17
Trees with maximum exponential Randić index	16
Charging station optimization for balanced electric car sharing	16
New bounds on clique-chromatic numbers of Johnson graphs	16

The Wiener index of the zero-divisor graph of a finite commutative ring with unity	16
Improved approximation algorithms for cumulative VRP with stochastic demands	16
Mim-Width I. Induced path problems	16
Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs	16
Open problems on the exponential vertex-degree-based topological indices of graphs	15
Reliability measure of multiprocessor system based on enhanced hypercubes	15
Mixed metric dimension of graphs with edge disjoint cycles	14
Edge-disjoint paths in faulty augmented cubes	14
Roman {3}-domi	14
The fault tolerance of (n,k<	14
The reliability analysis based on the generalized connectivity in balanced hypercubes	13
Further analysis of bent functions from C and	13
On the eigenvalues of eccentricity matrix of graphs	13
K1,<	13
The Wiener index of the zero-divisor graph of 13
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms	13
The statistical analysis for Sombor indices in a random polygonal chain networks	12
Vertex-degree based topological indices of digraphs	12
Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern	12
Estimating the r-colorability threshold for a random hypergraph	12
Few-weight codes over F	12
House of Graphs 2.0: A database of interesting graphs and more	12
Double domination in lexicographic product graphs	12
Monitoring the edges of a graph using distances	12
R3	12
Construction of weightwise perfectly balanced Boolean functions with high weightwise nonlinearity	12
The hexagonal chains with the first three maximal Mostar indices	11
Burning number of caterpillars	11
On the eccentricity spectra of threshold graphs	11
Note on injective edge-coloring of graphs	11
A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout	11
Perfect state transfer in NEPS of complete graphs	11
Inequalities between the Kk	10
Maximizing the number of cliques in graphs with given matching number	10
Cluster connectivity of hypercube-based networks under the super fault-tolerance condition	10
On g-good-neighbor conditional connectivity and diagnosability of hi	10
Investigations on c-boomerang uniformity and perfect nonlinearity	10
Counting and enumerating galled networks	10
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem	10
The Steiner tree in K	10
Fault-tolerant strong Menger (edge) connectivity of arrangement graph	10
Fair division with multiple pieces	10
The h-restricted connectivity of balanced hypercubes	10
On the Kirchhoff index of bipartite graphs with given diameters	10
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand	10
A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows	10
Two classes of optimal p-ary few-weight codes from down-sets	9
On algorithmic complexity of double Roman domination	9
Computing graph gonality is hard	9
On the anti-Ramsey number of forests	9

On the complexity of cd-coloring of graphs	9
Intersection of longest paths in graph classes	9
Embedding planar 5-graphs in three pages	9
A note on double domination in graphs	9
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs	9
Enumerating connected induced subgraphs: Improved delay and experimental comparison	9
A tree distinguishing polynomial	9
Maker–Breaker total domination game	9
Matrix representation of stability definitions in the graph model for conflict resolution with grey-based preferences	9
The clique problem with multiple-choice constraints under a cycle-free dependency graph	9
The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions	8
General Randić index of unicyclic graphs with given diameter	8
Dynamic programming bi-criteria combinatorial optimization	8
A Hamilton sufficient condition for completely independent spanning tree	8
Sylvester power and weighted sums on the Frobenius set in arithmetic progression	8
Torus-like graphs and their paired many-to-many disjoint path covers	8
Kemeny’s constant for several families of graphs and real-world networks	8
Injective coloring of some subclasses of bipartite graphs and chordal graphs	8
The asymptotic value of graph energy for random graphs with degree-based weights	8
Wirelength of embedding complete multipartite graphs into certain graphs	8
On simplified NP-complete variants of Monotone 3 -Sat	8
General sum-connectivity index of unicyclic graphs with given diameter	8
A theoretical investigation on the distinguishers of Salsa and ChaCha	8
Colorings with neighborhood parity condition	8
Perfect matching and distance spectral radius in graphs and bipartite graphs	8
Symmetric property and reliability of locally twisted cubes	8
Extreme Wiener indices of trees with given number of vertices of maximum degree	8
Some notes on the extremal k-generalized quasi-unicyclic graphs with	8
Finding densest k-connected subgraphs	8
The limiting behaviours for the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain	8
Reliability assessment of the Cayley graph generated by trees	8
Perfect double Roman domination of trees	7
The iterated local model for social networks	7
Extremal vertex-degree function index for trees and unicyclic graphs with given independence number	7
Unified extremal results for k-apex unicyclic graphs (trees)	7
Tracking Paths	7
An O∗	7
Unicyclic and bicyclic graphs with maximum exponential second Zagreb index	7
Sharp upper bounds on the Q-index of (minimally) 2-connected graphs w	7
List injective edge-coloring of subcubic graphs	7
Unicyclic graphs with extremal values of arithmetic–geometric index	7
Generalized cut method for computing the edge-Wiener index	7
The number of subtrees in graphs with given number of cut edges	7
The (degree-) Kirchhoff indices in random polygonal chains	7
Vectorial bent functions weakly/strongly outside the completed Maiorana–McFarland class	7
Monochromatic disconnection of graphs	7
Min–max–min robustness for combinatorial problems with discrete budgeted uncertainty	7
Constructing new families of transmission irregular graphs	7
Edge coloring of signed graphs	7
On three outer-independent domination related parameters in graphs	7
Vertex and edge metric dimensions of unicyclic graphs	7
The general position achievement game played on graphs	7
Tight isolated toughness bound for fractional (k	7
Graph r-hued colorings—A survey	6
Remarks on odd colorings of graphs	6
Letter graphs and geometric grid classes of permutations: Characterization and recognition	6
Extremal results for graphs of bounded metric dimension	6
Decomposition of planar graphs with forbidden configurations	6
An improved upper bound for the acyclic chromatic number of 1-planar graphs	6
New lower bounds for the first variable Zagreb index	6
A faster FPTAS for knapsack problem with cardinality constraint	6
Existence of all generalized fractional (g,<	6
On card guessing game with one time riffle shuffle and complete feedback	6
Some spectral inequalities for connected bipartite graphs with maximum	6
Minimum augmented Zagreb index of c-cyclic graphs	6
On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2	6
Revising Johnson’s table for the 21st century	6
Comments on “A Hamilton sufficient condition for completely independent spanning tree”	6
Normalized Laplacian spectrum of complete multipartite graphs	6
Integral cographs	6
The co-secure domination in proper interval graphs	6
Minimum Spanning Tree Cycle Intersection problem	6
Exact square coloring of subcubic planar graphs	6
Random walks and Laplacians on hypergraphs: When do they match?	6
A new approach to finding the extra connectivity of graphs	6
Homomorphic extensions of CRT-based secret sharing	6
On cyclic codes over Galois rings	6
New bounds on the double domination number of trees	6
Efficient enumeration of maximal induced bicliques	6
Fair multi-cake cutting	6

The harmonic index of a graph and its DP-chromatic number	6
Extremal problems on distance spectra of graphs	6
From modular decomposition trees to rooted median graphs	6
Constructions of (vectorial) bent functions outside the completed Maiorana–McFarland class	6
Strong chromatic index of K1	6
On the (di)graphs with (directed) proper connection number two	6
Antimagic orientation of lobsters	6
Vertex and edge metric dimensions of cacti	6
Approximating connected safe sets in weighted trees	6
Several classes of PcN power functions over finite fields	6
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter	6
Fibonacci-run graphs I: Basic properties	6
The expected values of Wiener indices in random polycyclic chains	6
Homogeneous sets, clique-separators, critical graphs, and optimal χ-b	6
Laplacian state transfer in edge complemented coronas	6
A connected version of the graph coloring game	6
On the weightwise nonlinearity of weightwise perfectly balanced functions	5
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability	5
The tree-width of C	5
Further results on the Merrifield–Simmons index	5
Limited visibility Cops and Robber	5
On the number of almost envy-free allocations	5
Improved descriptional complexity results on generalized forbidding grammars	5
Blocking zero forcing processes in Cartesian products of graphs	5
Second-order productivity, second-order payoffs, and the Shapley value	5
A note on odd colorings of 1-planar graphs	5
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees	5
How tree-based is my network? Proximity measures for unrooted phylogenetic networks	5
Construction of weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables	5
Planar graphs without short even cycles are near-bipartite	5
Sharp bounds on the Arithmetic–geometric index of graphs and line graphs	5
On the semi-proper orientations of graphs	5
The minimum second Zagreb eccentricity index of graphs with parameters	5
Extremal trees of given segment sequence with respect to some eccentricity-based invariants	5
Perfect Italian domination on planar and regular graphs	5
Constructive characterizations concerning weak Roman domination in trees	5
New bounds for perfect k-hashing	5
Grundy dominating sequences on X-join product	5
Improved sufficient conditions for k-leaf-connected graphs	5
On the (signless Laplacian) spectral radius of minimally k-(edge)-con	5
Multiplicative version of eccentric connectivity index	5
On the Kirchhoff index of a graph and the matchings of the subdivision	5
A note onk-metric dimensional graphs	5
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods	5
A polyhedral model for enumeration and optimization over the set of circuits	5
Domination and location in twin-free digraphs	5
Note on Sombor index of connected graphs with given degree sequence	5
A polynomial algorithm for minimizing discrete convic functions in fixed dimension	5
On list 3-dynamic coloring of near-triangulations	5
Integer k-matchings of graphs: 5
On the complexity of min–max–min robustness with two alternatives and budgeted uncertainty	5
On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs	5
On the resistance diameters of graphs and their line graphs	5
Harmonic index of a line graph	5
On-line DP-coloring of graphs	5
Truncated metric dimension for finite graphs	5
Biclique graphs of interval bigraphs	5
On the packing chromatic number of Moore graphs	5
Maximizing the strong triadic closure in split graphs and proper interval graphs	5
Strongly separable matrices for nonadaptive combinatorial group testing	5
Some results on k-critical 5
On the distance-edge-monitoring numbers of graphs	5
New comments on “A Hamilton sufficient condition for completely independent spanning tree”	5
Packing (1,1	5
Positive semidefiniteness of A	5
A note on 1-planar graphs with minimum degree 7	5
On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision	5
Resistance distance and Kirchhoff index in dihedral Cayley graphs	5
Seymour’s second neighborhood conjecture for 5-anti-transitive oriented graphs	5
Thinness of product graphs	5
A symmetry-free polynomial formulation of the capacitated vehicle routing problem	5
Parameterized and exact algorithms for class domination coloring	4
A new construction of broadcast graphs	4
Edge metric dimension and mixed metric dimension of planar graph Q	4
The threshold dimension of a graph	4
On m-step competition graphs of bipartite tournaments	4
Dominating sets reconfiguration under token sliding	4
On the degree Kirchhoff index of unicyclic graphs	4
Parameterized complexity of fair deletion problems	4
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3	4
On a conjecture of Schweser and Stiebitz	4
Sparse recovery with integrality constraints	4
The second largest eigenvalue and vertex-connectivity of regular multigraphs	4
Investigating the recoverable robust single machine scheduling problem under interval uncertainty	4
Spanning 2-forests and resistance distance in 2-connected graphs	4
Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model	4
Stability factor for robust balancing of simple assembly lines under uncertainty	4
A de Bruijn–Erdös Theorem for(q,	4
On NP-hard graph properties characterized by the spectrum	4
Domination parameters in hypertrees and sibling trees	4
On null 3-hypergraphs	4
Feedback edge sets in temporal graphs	4
L(p,	4
Dominating maximal outerplane graphs and Hamiltonian plane triangulations	4
Neighbor connectivity of pancake graphs and burnt pancake graphs	4