Discrete Mathematics

Article	Citations
Near MDS codes from oval polynomials	18
Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond	17
On the largest and least eigenvalues of eccentricity matrix of trees	16
Spectral theory of Laplace operators on oriented hypergraphs	16
A spectral version of Mantel's theorem	16
Isolation of k-cliques II	16
The spectral radius of graphs with no intersecting odd cycles	14
Maxima of L-index and Q-index: Graphs with given size and diameter	14
Low c-differential and c-boomerang uniformity of the swapped inverse function	14
Energy and inertia of the eccentricity matrix of coalescence of graphs	14
Note on sunflowers	14
On a rank-unimodality conjecture of Morier-Genoud and Ovsienko	14
New constructions of large cyclic subspace codes and Sidon spaces	14
Weighted generalized crank moments for k-colored partitions and Andrews-Beck type congruences	13
Sampling hypergraphs with given degrees	13
Minimal linear codes from weakly regular plateaued balanced functions	13
Complete classification of repeated-root σ-constacyclic codes of pr	13
Laplacian state transfer in total graphs	12
Extremal augmented Zagreb index of trees with given numbers of vertices and leaves	12
CharacterizingP⩾2	12
The spectral radius of graphs with given independence number	12
On the Tu-Zeng permutation trinomial of type (1	12
Proof of a Lin-Peng-Toh's conjecture on an Andrews-Beck type congruence	12
On the spectral radius of graphs without a star forest	11
An arithmetic criterion for graphs being determined by their generalized A-spectra	11

Cyclic codes over a non-chain ring R, and their application to LCD codes	11
A class of skew cyclic codes and application in quantum codes construction	11
The Turán number for the edge blow-up of trees	11
The A-spectral radius for path-factors in graphs	11
The maximum number of paths of length four in a planar graph	11
Adjacency eigenvalues of graphs without short odd cycles	11
Exact rainbow numbers for matchings in plane triangulations	10
On unitary Cayley graphs of matrix rings	10
A context-free grammar for the e-positivity of the trivariate second-order Eulerian polynomials	9
Remarks on proper conflict-free colorings of graphs	9
Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs	9
A class of two or three weights linear codes and their complete weight enumerators	9
On Turán-good graphs	9
Hermitian adjacency matrix of the second kind for mixed graphs	9
Cover and variable degeneracy	9
Finite exceptional groups of Lie type and symmetric designs	8
D-index and 8
Signed graphs with maximal index	8
Anti-Ramsey number of matchings in a hypergraph	8
On the eccentricity matrices of trees: Inertia and spectral symmetry	8
Constructing MDS Galois self-dual constacyclic codes over finite fields	8
On the strong chromatic number of a random 3-uniform hypergraph	8
Designing DNA codes from reversible self-dual codes over GF	8
Spectral radius and [a,b]-factors in graphs	8
Star-critical Ramsey numbers involving graphs with long suspended paths	8
Combinatorial Nullstellensatz and DP-coloring of graphs	7
A formula for enumerating permutations with a fixed pinnacle set	7
Minimal hexagonal chains with respect to the Kirchhoff index	7
Connectivity keeping caterpillars and spiders in 2-connected graphs	7
The maximum spectral radius of wheel-free graphs	7
On the anti-Ramsey numbers of linear forests	7
Graphs with n	7
List 3-coloring Pt	7
Construction of orthogonal arrays of strength three by augmented difference schemes	7
Permanental sums of graphs of extreme sizes	7
Reducing the domination number of graphs via edge contractions and vertex deletions	7
On the generalized A-spectral characterizations of almost α-controllable graphs	7
On the chromatic number of some P5-free graphs	7
Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs	7
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests	7
Graphs with nullity 2c(G)+p(G)−1	7
An overview of graph covering and partitioning	7
Local metric dimension for graphs with small clique numbers	7
Upper bound for the geometric-arithmetic index of trees with given domination number	7
On the existence of integer relative Heffter arrays	7
On clique immersions in line graphs	7
Euclidean matchings and minimality of hyperplane arrangements	6
Super-simple BIBDs with block size 4 and index 7	6
Extremal spectral results related to spanning trees of signed complete graphs	6
On the (reverse) cover cost of trees with some given parameters	6

Generalized Turán number for linear forests	6
The Waring’s problem over finite fields through generalized Paley graphs	6
Smith Normal Form and the generalized spectral characterization of graphs	6
Twin-width and generalized coloring numbers	6
The DP color function of joins and vertex-gluings of graphs	6
Rational points on complete symmetric hypersurfaces over finite fields	6
Stabbing pairwise intersecting disks by five points	6
Maximum sparse induced subgraphs of the binomial random graph with given number of edges	6
Dimensions of nonbinary antiprimitive BCH codes and some conjectures	6
Non-zero sum Heffter arrays and their applications	6
Linear sets on the projective line with complementary weights	6
On linear sets of minimum size	6
Badges and rainbow matchings	6
Planar Turán number of intersecting triangles	6
On large set plus of disjoint incomplete Latin squares	6
Classification of tetravalent distance magic circulant graphs	6
Antimagic orientations of graphs with large maximum degree	6
Every 3-connected {K	6
The inverse eigenvalue problem for linear trees	6
D-magic labelings of the folded n-cube	6
Optimization of eigenvalue bounds for the independence and chromatic number of graph powers	5
Generalizing theorems of Nosal and Nikiforov: Triangles and quadrilaterals	5
Proximity and remoteness in directed and undirected graphs	5
The polynomial reconstruction problem: The first 50 years	5
3-setwise intersecting families of the symmetric group	5
Gain distance matrices for complex unit gain graphs	5
Decomposability and co-modular indices of tournaments	5
Partition identities related to the minimal excludant	5
Fractional revival and association schemes	5
Oriented bipartite graphs and the Goldbach graph	5
Almost eulerian compatible spanning circuits in edge-colored graphs	5
Some results on the spum and the integral spum of graphs	5
Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate	5
On two-weight codes	5
The cyclic index of adjacency tensor of generalized power hypergraphs	5
Properly colored C4<	5
New infinite families of near MDS codes holding t-designs	5
Investigating the discrepancy property of de Bruijn sequences	5
A characterization of the family of secant lines to a hyperbolic quadric in P	5
Convex lattice polygons with all lattice points visible	5
Graphs in which G − N[v] is a cycle for each vertex v	5
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space	5
On discrete Brunn-Minkowski and isoperimetric type inequalities	5
Graph classes with linear Ramsey numbers	5
Generalized asymptotic Sidon basis	5
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournamen	5
On ABC Estrada index of graphs	5
Odd coloring of sparse graphs and planar graphs	5
The maximum spectral radius of t-connected graphs with bounded matching number	5
The maximum sum of sizes of cross-intersecting families of subsets of a set	5
The m-Schröder paths and 5
Partial γ-positivity for quasi-Stirling permutations of multisets	5
Linear codes with few weights from weakly regular plateaued functions	5
Trees with extremal numbers of k-dominating sets	5
Peakless Motzkin paths with marked level steps at fixed height	5
Monochromatic stars in rainbowK	5
A new bound on the acyclic edge chromatic number	5
1-planar graphs are odd 13-colorable	5
Alternating Eulerian polynomials and left peak polynomials	5
2-distance coloring of planar graphs with maximum degree 5	5
Subgroup regular sets in Cayley graphs	5
A new criterion for almost controllable graphs being determined by their generalized spectra	5
Constructing vectorial bent functions via second-order derivatives	5
Finite distributive nearlattices	4
DP-4-coloring of planar graphs with some restrictions on cycles	4
Nowhere-zero 3-flows in Cayley graphs of order pq2	4
Defective DP-colorings of sparse simple graphs	4
Extremal product-one free sequences and |G|-product-one free sequences of a metacyclic group	4
Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph	4
Majorization, degree sequence and A	4
Idempotents of generalized quaternion group algebras and their applications	4
Some results on k-Turán-good graphs	4
A note on multicolor Ramsey number of small odd cycles versus a large clique	4
Addition chains, vector chains, and efficient computation	4
Exponential lower bounds on the generalized Erdős–Ginzburg–Ziv constant	4
Generalized Turán results for intersecting cliques	4
Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24	4
Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings	4
New MDS EAQECCs derived from constacyclic codes over F	4
Proximity and remoteness in triangle-free and C4-free graphs in terms of order and minimum degree	4

Improved square coloring of planar graphs	4
Clique immersions in graphs of independence number two with certain forbidden subgraphs	4
Beck-type companion identities for Franklin's identity via a modular refinement	4
The cubic graphs with finite cyclic vertex connectivity larger than girth	4
Vertex-disjoint rainbow triangles in edge-colored graphs	4
New characterizations and construction methods of bent and hyper-bent Boolean functions	4
Extremal problems on k-ary trees with respect to the cover cost and reverse cover cost	4
A q-analogue of the bipartite distance matrix of a nonsingular tree	4
Coloring of (P5, 4-wheel)-free graphs	4
Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres	4
The Turán number for the edge blow-up of trees: The missing case	4
On Toeplitz codes of index t and isometry codes	4
Every planar graph with girth at least 5 is (1,9)-colorable	4
On the maximum number of distinct intersections in an intersecting family	4
Basis criteria for generalized spline modules via determinant	4
Connectivity keeping paths in k-connected bipartite graphs	4
On quasi-strongly regular graphs with parameters (n	4
Two new classes of permutation trinomials over F	4
On the maximal number of elements pairwise generating the symmetric group of even degree	4
A proof of the fermionic theta coinvariant conjecture	4
Eulerian pairs and Eulerian recurrence systems	4
An enumeration of 1-perfect ternary codes	4
Choosability with union separation of triangle-free planar graphs	4
Proof of a conjecture on the spectral radius condition for [a,b]-factors	4
Enumerating symmetric and asymmetric peaks in Dyck paths	4
Solvable conjugacy class graph of groups	4
Fairest edge usage and minimum expected overlap for random spanning trees	4
On Wegner’s inequality for axis-parallel rectangles	4
Cycles on a multiset with only even-odd drops	4
On flag-transitive automorphism groups of 2-designs	4
Solving linear equations in a vector space over a finite field	4
The group Cp4	4
The firefighter problem on polynomial and intermediate growth groups	4
Large cycles in random generalized Johnson graphs	4
Resistance distance and Kirchhoff index of the Q-vertex (or edge) join graphs	4
A gentle introduction to the differential equation method and dynamic concentration	4
Super-simple group divisible designs with block size 4 and index λ = 7,8	4
Cubic graphical regular representations of PSU3(q)	4
The maximum number of 10- and 12-cycles in a planar graph	4
Existence of 4-GDDs with at most 50 points and 4-GDDs of types 6 3 and 9 3	4
Turán and Ramsey numbers in linear triple systems	4
Anti-Ramsey numbers for trees in complete multi-partite graphs	4
Complete circular regular dessins of coprime orders	3
An (increasing) sequence of lower bounds for the spectral radius and energy of digraphs	3
Classes of graphs without star forests and related graphs	3
Ramsey numbers of several K, and a large K,	3
Recoloring graphs of treewidth 2	3
Galois self-dual extended duadic constacyclic codes	3
Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs	3
Pushable chromatic number of graphs with degree constraints	3
Platonic solids, Archimedean solids and semi-equivelar maps on the sphere	3
On the lower bound for the length of minimal codes	3
Hadamard matrices of order 36 formed by codewords in some ternary self-dual codes	3
The reconstruction conjecture for finite simple graphs and associated directed graphs	3
Clique dynamics of locally cyclic graphs with δ ≥ 6	3
Gallai-Ramsey numbers for fans	3
On the neighborhood complex of s	3
An extension of the rainbow Erdős-Rothschild problem	3
On the automorphism groups of Lunardon-Polverino scattered linear sets	3
Janko sporadic groupJ	3
On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching	3
On the forcing matching numbers of prisms of graphs	3
On graphs with exactly one anti-adjacency eigenvalue and beyond	3
Rectangular Heffter arrays: a reduction theorem	3
Cohen–Macaulayness of a class of graphs versus the class of their complements	3
A note on distinguishing trees with the chromatic symmetric function	3
Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices	3
Hat chromatic number of graphs	3
Algorithms for q-ary error-correcting codes with limited magnitude a	3
Cops and robbers on 2K2-free graphs	3
A simple explanation for the “shuffling phenomenon” for lozenge tilings of dented hexagons	3
On the smallest trees with the same restricted U-polynomial and the r	3
Planar graphs without specific cycles are 2-degenerate	3
On the sum of sizes of overlapping families	3
The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles	3
Orthogonal colourings of Cayley graphs	3
On the volume of projections of the cross-polytope	3
Saxl Conjecture for triple hooks	3
The q-log-concavity and unimodality of q-Kaplansky numbers	3
Extremal problems and results related to Gallai-colorings	3
Self-dual codes over F5	3
Locating-dominating sets: From graphs to oriented graphs	3
Exact hyperplane covers for subsets of the hypercube	3
A note on a pair of orthogonal orthomorphisms of cyclic groups	3
Injective coloring of graphs revisited	3
Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three	3
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem	3
The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one	3
Perfect state transfer on bi-Cayley graphs over abelian groups	3
On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids	3
Bounds and constructions for multilength variable-weight optical orthogonal codes	3
A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs	3
Maxima of the Q-index: Forbidden a fan	3
The k-apex trees with minimum augmented Zagreb index	3
The path minimises the average size of a connected induced subgraph	3