Discrete Mathematics

Article	Citations
Spectral extrema of graphs: Forbidden hexagon	27
Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond	21
Isolation of k-cliques	20
The multiplicity of an Aα	18
On matrix-product structure of repeated-root constacyclic codes over finite fields	17
Vertex properties of maximum scattered linear sets of PG	16
Near MDS codes from oval polynomials	15
A spectral version of Mantel's theorem	14
Several kinds of large cyclic subspace codes via Sidon spaces	14
An efficient method to construct self-dual cyclic codes of length p	14
Maker–Breaker domination game	13
New constructions of large cyclic subspace codes and Sidon spaces	13
Low c-differential and c-boomerang uniformity of the swapped inverse function	13
MRD codes with maximum idealizers	13
Maxima of L-index and Q-index: Graphs with given size and diameter	12
Signless Laplacian spectral radius and fractional matchings in graphs	12
Extremal cover cost and reverse cover cost of trees with given segment sequence	12
On a rank-unimodality conjecture of Morier-Genoud and Ovsienko	12
Note on sunflowers	12
Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond	12
Spectral theory of Laplace operators on oriented hypergraphs	12
A class of skew cyclic codes and application in quantum codes construction	11
On the largest and least eigenvalues of eccentricity matrix of trees	11
Laplacian state transfer in total graphs	11
Isolation of k-cliques II	11

Exact rainbow numbers for matchings in plane triangulations	10
The spectral radius of graphs with given independence number	10
On the Tu-Zeng permutation trinomial of type (1	10
Characterization of subgroup perfect codes in Cayley graphs	10
Weighted generalized crank moments for k-colored partitions and Andrews-Beck type congruences	10
The spectral radius of graphs with no intersecting odd cycles	10
A note on linear complementary pairs of group codes	9
The maximum number of paths of length four in a planar graph	9
Proof of a Lin-Peng-Toh's conjecture on an Andrews-Beck type congruence	9
On the eigenvalues of Aα	9
Globally simple Heffter arrays H(	9
An arithmetic criterion for graphs being determined by their generalized A-spectra	9
Designing DNA codes from reversible self-dual codes over GF	9
Hermitian adjacency matrix of the second kind for mixed graphs	9
Extremal augmented Zagreb index of trees with given numbers of vertices and leaves	9
CharacterizingP⩾2	9
On the spectral radius of graphs without a star forest	9
Graphs with flexible labelings allowing injective realizations	9
Minimal linear codes from weakly regular plateaued balanced functions	9
The Alon–Tarsi number of planar graphs without cycles of lengths 4 and l	9
Sampling hypergraphs with given degrees	9
Energy and inertia of the eccentricity matrix of coalescence of graphs	8
On the strong chromatic number of a random 3-uniform hypergraph	8
Anti-Ramsey number of matchings in a hypergraph	8
Complete classification of repeated-root σ-constacyclic codes of pr	8
The formula for Turán number of spanning linear forests	8
On theb-distance of repeated-root constacyclic codes of prime power l	8
A class of two or three weights linear codes and their complete weight enumerators	8
On unitary Cayley graphs of matrix rings	8
The Turán number for the edge blow-up of trees	8
An odd [1,b	8
List 3-coloring Pt	7
On Turán-good graphs	7
Constructing MDS Galois self-dual constacyclic codes over finite fields	7
Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs	7
Star-critical Ramsey numbers involving graphs with long suspended paths	7
Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs	7
Spectral radius and [a,b]-factors in graphs	7
Adjacency eigenvalues of graphs without short odd cycles	7
On the anti-Ramsey numbers of linear forests	7
Combinatorial Nullstellensatz and DP-coloring of graphs	7
The annihilation number does not bound the 2-domination number from the above	7
Linked partition ideals and Kanade–Russell conjectures	7
On the chromatic number of some P5-free graphs	7
Cyclic codes over a non-chain ring R, and their application to LCD codes	7
The maximum spectral radius of wheel-free graphs	6
Cover and variable degeneracy	6
On the number of Laplacian eigenvalues of trees less than the average degree	6
Super-simple BIBDs with block size 4 and index 7	6
Signed graphs with maximal index	6

Local metric dimension for graphs with small clique numbers	6
Coloring hypergraphs with bounded cardinalities of edge intersections	6
Compatible spanning circuits in edge-colored graphs	6
Badges and rainbow matchings	6
A formula for enumerating permutations with a fixed pinnacle set	6
Finite exceptional groups of Lie type and symmetric designs	6
On the (reverse) cover cost of trees with some given parameters	6
The Waring’s problem over finite fields through generalized Paley graphs	6
Hypercellular graphs: Partial cubes without Q	6
On the generalized A-spectral characterizations of almost α-controllable graphs	6
On the existence of integer relative Heffter arrays	6
Stabbing pairwise intersecting disks by five points	6
A context-free grammar for the e-positivity of the trivariate second-order Eulerian polynomials	6
The symmetric representation of lines in PG	6
Characterization of 1-tough graphs using factors	6
D-magic labelings of the folded n-cube	6
AG codes from the second generalization of the GK maximal curve	5
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournamen	5
On constacyclic codes of length p	5
On linear sets of minimum size	5
The DP color function of joins and vertex-gluings of graphs	5
Remarks on proper conflict-free colorings of graphs	5
Number of distinguishing colorings and partitions	5
Planar graphs without 7-cycles and butterflies are DP-4-colorable	5
Trees with extremal numbers of k-dominating sets	5
New MDS EAQECCs derived from constacyclic codes over F	5
Peakless Motzkin paths with marked level steps at fixed height	5
The strong edge-coloring for graphs with small edge weight	5
Arithmetical structures on bidents	5
Permanental sums of graphs of extreme sizes	5
Non-zero sum Heffter arrays and their applications	5
Every 3-connected {K	5
Acyclic coloring of graphs and entropy compression method	5
Colouring exact distance graphs of chordal graphs	5
Twin-width and generalized coloring numbers	5
The maximum spectral radius of t-connected graphs with bounded matching number	5
The inverse eigenvalue problem for linear trees	5
Oriented cliques and colorings of graphs with low maximum degree	5
Equitable partition of plane graphs with independent crossings into induced forests	5
Critical graphs for the chromatic edge-stability number	5
Partial γ-positivity for quasi-Stirling permutations of multisets	5
Inducibility of directed paths	5
An overview of graph covering and partitioning	5
Generalized Turán number for linear forests	5
Connectivity keeping caterpillars and spiders in 2-connected graphs	5
Antimagic orientations of graphs with large maximum degree	5
Reducing the domination number of graphs via edge contractions and vertex deletions	5
Constructing vectorial bent functions via second-order derivatives	5
The maximum sum of sizes of cross-intersecting families of subsets of a set	5
Self-dual codes using bisymmetric matrices and group rings	5
Upper bound for the geometric-arithmetic index of trees with given domination number	5
Convex lattice polygons with all lattice points visible	5
Graphs with n	5
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests	5
Extremal digraphs avoiding an orientation ofC	5
Rational points on complete symmetric hypersurfaces over finite fields	5
A new bound on the acyclic edge chromatic number	5
Alternating Eulerian polynomials and left peak polynomials	5
MacWilliams type identities for linear codes on certain pomsets: Chain, direct and ordinal sum of pomsets	4
The cyclic index of adjacency tensor of generalized power hypergraphs	4
Group distance magic Cartesian product of two cycles	4
On ABC Estrada index of graphs	4
Large cycles in random generalized Johnson graphs	4
Generalization of two problems of George Beck	4
Some results on the spum and the integral spum of graphs	4
Domination versus independent domination in graphs of small regularity	4
Almost eulerian compatible spanning circuits in edge-colored graphs	4
Choosability with union separation of triangle-free planar graphs	4
Some results on k-Turán-good graphs	4
Graph classes with linear Ramsey numbers	4
Finite distributive nearlattices	4
Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function	4
Kirkman triple systems with subsystems	4
Computational results and new bounds for the circular flow number of snarks	4
New characterizations and construction methods of bent and hyper-bent Boolean functions	4
Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres	4
Minimal hexagonal chains with respect to the Kirchhoff index	4
A Chung–Feller property for the generalized Schröder paths	4
Monochromatic stars in rainbow K	4
The strong fractional choice number of series–parallel graphs	4

Fractional revival and association schemes	4
Properly colored C4<	4
Coloring of (P5, 4-wheel)-free graphs	4
Fairest edge usage and minimum expected overlap for random spanning trees	4
Two results about the Turán number of star forests	4
Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24	4
On eigenvalue multiplicity in signed graphs	4
On discrete Brunn-Minkowski and isoperimetric type inequalities	4
The m-Schröder paths and 4
On quasi-strongly regular graphs with parameters (n	4
Exponential lower bounds on the generalized Erdős–Ginzburg–Ziv constant	4
Proximity and remoteness in directed and undirected graphs	4
The polynomial reconstruction problem: The first 50 years	4
Improving lower bounds on the second-order nonlinearity of three classes of Boolean functions	4
Eulerian pairs and Eulerian recurrence systems	4
On the maximum number of distinct intersections in an intersecting family	4
Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate	4
On large set plus of disjoint incomplete Latin squares	4
Anti-Ramsey numbers for trees in complete multi-partite graphs	4
Weight enumerators, intersection enumerators, and Jacobi polynomials	4
On even cycle decompositions of line graphs of cubic graphs	4
A characterization of the family of secant lines to a hyperbolic quadric in P	4
Smith Normal Form and the generalized spectral characterization of graphs	4
Circular embeddability of isometric words	4
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8	4
Construction of orthogonal arrays of strength three by augmented difference schemes	4
Orientable arithmetic matroids	4
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space	4
Basis criteria for generalized spline modules via determinant	4
Cycles on a multiset with only even-odd drops	4
Decomposability and co-modular indices of tournaments	4
Planar Turán number of intersecting triangles	4
Super-simple group divisible designs with block size 4 and index λ = 7,8	4
The firefighter problem on polynomial and intermediate growth groups	4
Partitioning sparse graphs into an independent set and a graph with bounded size components	4
Strong difference families of special types	4
Existence of 4-GDDs with at most 50 points and 4-GDDs of types 6 3 and 9 3	4
Investigating the discrepancy property of de Bruijn sequences	4
Reduction for primitive flag-transitive symmetric 2-(v	4
The cubic graphs with finite cyclic vertex connectivity larger than girth	4
3-setwise intersecting families of the symmetric group	4
On clique immersions in line graphs	4
Set systems related to a house allocation problem	4
Euclidean matchings and minimality of hyperplane arrangements	4
Gain distance matrices for complex unit gain graphs	4
DP-4-coloring of planar graphs with some restrictions on cycles	4
Defective DP-colorings of sparse simple graphs	4
Classification of tetravalent distance magic circulant graphs	4
Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph	4
Extremal problems on k-ary trees with respect to the cover cost and reverse cover cost	4
On Wegner’s inequality for axis-parallel rectangles	4
Enumerating symmetric and asymmetric peaks in Dyck paths	4
On two-weight codes	4
Majorization, degree sequence and A	4
Isoperimetry, stability, and irredundance in direct products	4
Sum-free sets generated by the period-k-folding sequences and some Stu	3
Odd coloring of sparse graphs and planar graphs	3
Planar graphs without specific cycles are 2-degenerate	3
On the sum of sizes of overlapping families	3
Eulerian and even-face ribbon graph minors	3
On the existence of dense substructures in finite groups	3
Pushable chromatic number of graphs with degree constraints	3
Classes of graphs without star forests and related graphs	3
An (increasing) sequence of lower bounds for the spectral radius and energy of digraphs	3
Janko sporadic group J	3
On the forcing matching numbers of prisms of graphs	3
The geometry and combinatorics of discrete line segment hypergraphs	3
Solving linear equations in a vector space over a finite field	3
An extension of the rainbow Erdős-Rothschild problem	3
Several families of q-ary minimal linear codes with	3
On self-dual skew cyclic codes of length p over F<	3
Bounds and constructions for multilength variable-weight optical orthogonal codes	3
Gallai-Ramsey numbers for fans	3
A q-analogue of the bipartite distance matrix of a nonsingular tree	3
Cops and robbers on 2K2-free graphs	3
On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids	3
Automorphism groups and new constructions of maximum additive rank metric codes with restrictions	3
Hat chromatic number of graphs	3
Bounded degree complexes of forests	3
T-core shifted Young diagrams	3
Algorithms for q-ary error-correcting codes with limited magnitude a	3
Idempotents of generalized quaternion group algebras and their applications	3
Linear sets on the projective line with complementary weights	3
A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs	3
Some codes in symmetric and linear groups	3
Efficient universal cycle constructions for weak orders	3
Ballot permutations and odd order permutations	3
The group Cp4	3
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs	3
Locating-dominating sets: From graphs to oriented graphs	3
Colourings of oriented connected cubic graphs	3
Rank conditions for sign patterns that allow diagonalizability	3
Dihedral sieving phenomena	3
On the smallest trees with the same restricted U-polynomial and the r	3
Generalizing theorems of Nosal and Nikiforov: Triangles and quadrilaterals	3