期刊： DISCRETE MATHEMATICS, 2023; 346 (1)
An r-uniform hypergraph is linear if every two edges intersect in at most one vertex. Given a family of r-uniform hypergraphs F, the linear Turan numb......
期刊： DISCRETE MATHEMATICS, 2023; 346 (1)
The graph coloring game is a two-player game in which the two players properly color an uncolored vertex of G alternately. The first player wins the g......
期刊： DISCRETE MATHEMATICS, 2023; 346 (1)
In this paper we give a complete description about normal monohedral tilings of a convex disc with smooth boundary where we have at most three topolog......
期刊： DISCRETE MATHEMATICS, 2023; 346 (1)
Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. This conjecture is disproved by constructi......
期刊： DISCRETE MATHEMATICS, 2023; 346 (1)
A pebbling move on a graph consists of removing 2 pebbles from a vertex and adding 1 pebble to one of the neighbouring vertices. A vertex is called re......
期刊： DISCRETE MATHEMATICS, 2023; 346 (3)
In [9], two of us classified line sets in PG(3, q), q odd, that satisfy a certain list of properties. It was shown there that if q >= 7, then each ......
期刊： DISCRETE MATHEMATICS, 2023; 346 (5)
For a multigraph H, a graph G is H-linked if every injective mapping phi : V (H) -> V (G) can be extended to an H-subdivision in G. We study the mi......
期刊： DISCRETE MATHEMATICS, 2023; 346 (5)
Improving a recent result of Fundikwa, Mazorodze, and Mukwembi, we show that d <= (2n-3)/5 for every connected C4-free graph of order n, diameter d......
期刊： DISCRETE MATHEMATICS, 2023; 346 (6)
Let H be an r-uniform hypergraph. The Turan number ex(n, H) is the maximum number of edges in an n-vertex H-free r-uniform hypergraph. The Turan densi......
期刊： DISCRETE MATHEMATICS, 2023; 346 (7)
Let G1 and G2 be two signed connected graphs with delta (G1) >= 2 and |E(G2)| >= 2. In this paper, we prove that the tensor product of two such ......
期刊： DISCRETE MATHEMATICS, 2023; 346 (7)
For a graph G, let A(G) be its adjacency matrix and let D(G) be the diagonal matrix of its vertex degrees. For alpha is an element of[0, 1], Nikiforov......
期刊： DISCRETE MATHEMATICS, 2023; 346 (7)
It is significant to investigate locally repairable codes (LRCs) since they have abundant applications to distributed storage systems. A locally repai......
期刊： DISCRETE MATHEMATICS, 2023; 346 (7)
Yin et al. (2021) [19] classified connected arc-transitive Cayley graphs on nonabelian simple groups with prime valency p >= 11 and solvable vertex......
期刊： DISCRETE MATHEMATICS, 2023; 346 (9)
An r-matrix is a matrix with symbols in {0, 1,...,r - 1}. A matrix is simple if it has no repeated columns. Let Fbe a finite set of r-matrices. Let fo......
期刊： DISCRETE MATHEMATICS, 2023; 346 (9)
Bose-Chaudhuri-Hocquenghem (BCH) codes have been intensively investigated. Even so, there is only a little known about primitive BCH codes, let alone ......
