期刊： DISCRETE MATHEMATICS, 2021; 344 (6)
We construct bijections to show that two pairs of multiple set-valued statistics of permutations are equidistributed on symmetric groups. This extends......
期刊： DISCRETE MATHEMATICS, 2021; 344 (3)
For graphs F, G and H, let F -> (G, H) signify that any red/blue edge coloring of F contains a red G or a blue H. The star-critical Ramsey number R......
期刊： DISCRETE MATHEMATICS, 2021; 344 (7)
Let p be a prime. A graph is called a bi-p-metacirculant on a metacyclic p-group H if admits a metacyclic p-group H of automorphisms acting semiregula......
期刊： DISCRETE MATHEMATICS, 2021; 344 (8)
An r-large set of Mendelsohn triple systems of order v, denoted by r-LMTS(v), is a large set of ordered designs of order v(LOD(v)) which contains rMTS......
期刊： DISCRETE MATHEMATICS, 2021; 344 (9)
We say that G has the property P if G - N[v] is a cycle for any vertex v is an element of V(G), where N[v] is the closed neighborhood of v in G. For a......
期刊： DISCRETE MATHEMATICS, 2021; 344 (11)
Let K be a set of positive integers and let G be an additive group. A (G, K, 1) difference packing is a set of subsets of G with sizes from K whose li......
期刊： DISCRETE MATHEMATICS, 2021; 344 (3)
We state that the minimum and the maximum support weight of subcodes of a code are useful in several aspects. Based on the above findings, we will det......
期刊： DISCRETE MATHEMATICS, 2021; 344 (6)
As a further development and deepening of two examples in the paper (Fan and Zhang, 2017), we construct MDS Galois self-dual constacyclic codes over f......
期刊： DISCRETE MATHEMATICS, 2021; 344 (11)
A hole is an induced cycle of length at least 4, and an even-hole is a hole of even length. A cap is a graph consisting of a hole and an additional ve......
期刊： DISCRETE MATHEMATICS, 2021; 344 (6)
In the past few years, linear codes with few weights constructed from defining-sets have been extensively studied. In this paper, we further investiga......
期刊： DISCRETE MATHEMATICS, 2021; 344 (6)
We make some progresses on Saxl Conjecture. Firstly, we show that the probability that a partition is comparable in dominance order to the staircase p......
期刊： DISCRETE MATHEMATICS, 2021; 344 (10)
The L-index (resp. Q-index) of a graph G is the largest eigenvalue of the Laplacian matrix (resp. signless Laplacian matrix) of G. In this paper, we d......
期刊： DISCRETE MATHEMATICS, 2021; 344 (11)
Let G be a graph with vertex set V-G = {v(1),v(2), ..., v(n)} and edge set E-G, and let di be the degree of the vertex v(i). The ABC matrix of G has t......
期刊： DISCRETE MATHEMATICS, 2021; 344 (11)
A P->= k-factor (k >= 2) of a graph G is a spanning subgraph of G in which each component is a path of order at least k. A graph G is called a P......
期刊： DISCRETE MATHEMATICS, 2021; 344 (8)
Let G be a connected graph of order n. The Steiner distance d(G)(S) of a set S of vertices is the minimum size of a connected subgraph of G that conta......
