共查询到20条相似文献,搜索用时 31 毫秒
1.
《Discrete Mathematics》2022,345(4):112774
Chvátal and Erdös (1972) [5] proved that, for a k-connected graph G, if the stability number , then G is Hamilton-connected () or Hamiltonian () or traceable (). Motivated by the result, we focus on tight sufficient spectral conditions for k-connected graphs to possess Hamiltonian s-properties. We say that a graph possesses Hamiltonian s-properties, which means that the graph is Hamilton-connected if , Hamiltonian if , and traceable if .For a real number , and for a k-connected graph G with order n, degree diagonal matrix and adjacency matrix , we have identified best possible upper bounds for the spectral radius , where Γ is either G or the complement of G, to warrant that G possesses Hamiltonian s-properties. Sufficient conditions for a graph G to possess Hamiltonian s-properties in terms of upper bounds for the Laplacian spectral radius as well as lower bounds of the algebraic connectivity of G are also obtained. Other best possible spectral conditions for Hamiltonian s-properties are also discussed. 相似文献
2.
In this paper, we give the dimension and the minimum distance of two subclasses of narrow-sense primitive BCH codes over with designed distance for all , where q is a prime power and is a positive integer. As a consequence, we obtain an affirmative answer to two conjectures proposed by C. Ding in 2015. Furthermore, using the previous part, we extend some results of Yue and Hu [16], and we give the dimension and, in some cases, the Bose distance for a large designed distance in the range for , where if m is odd, and if m is even. 相似文献
3.
4.
《Discrete Mathematics》2022,345(1):112669
In this paper, we consider two kinds of spectral extremal questions. The first asks which graph attains the maximum Q-index over all graphs of order n and size ? The second asks which graph attains the maximum Q-index over all -bipartite graphs with edges? We solve the first question for , and the second question for . The maximum Q-index on connected -bipartite graphs is also determined for . 相似文献
5.
6.
Let M be a random rank-r matrix over the binary field , and let be its Hamming weight, that is, the number of nonzero entries of M.We prove that, as with r fixed and tending to a constant, we have that converges in distribution to a standard normal random variable. 相似文献
7.
8.
《Discrete Mathematics》2022,345(8):112904
Let be the minimum integer such that every plane graph with girth g at least , minimum degree and no -paths consisting of vertices of degree 2, where , has a 3-vertex with at least t neighbors of degree 2, where .In 2015, Jendrol' and Maceková proved . Later on, Hudák et al. established , Jendrol', Maceková, Montassier, and Soták proved , and , and we recently proved that and .Thus is already known for and all t. In this paper, we prove that , , and whenever . 相似文献
9.
10.
11.
12.
The k-subset sum problem over finite fields is a classical NP-complete problem. Motivated by coding theory applications, a more complex problem is the higher m-th moment k-subset sum problem over finite fields. We show that there is a deterministic polynomial time algorithm for the m-th moment k-subset sum problem over finite fields for each fixed m when the evaluation set is the image set of a monomial or Dickson polynomial of any degree n. In the classical case , this recovers previous results of Nguyen-Wang (the case ) [22] and the results of Choe-Choe (the case ) [3]. 相似文献
13.
《Discrete Mathematics》2022,345(5):112802
We study logical limit laws for uniform attachment random graphs. In this random graph model, vertices and edges are introduced recursively: at time , the vertex is introduced together with m edges joining the new vertex with m different vertices chosen uniformly at random from . We prove that this random graph obeys convergence law for first-order sentences with at most variables. 相似文献
14.
15.
16.
17.
《Discrete Mathematics》2022,345(9):112966
A broom is a tree obtained by identifying an endpoint of a path with the center of a star. Let G be a connected graph of order . Chen et al. [2] conjectured that if the degree sum is at least for any three pairwise nonadjacent vertices, then G contains a spanning broom. In this paper, we confirm the conjecture for . 相似文献
18.
《Discrete Mathematics》2023,346(4):113304
In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size ? In this note, we improve upon a recent result of Frankl and resolve this problem for and . 相似文献
19.
Without the restriction of quadratic form as a Riemannian metric, a Finsler metric on a smooth manifold M can be reversible (symmetric in y) or not. Reversible Finsler metrics have different properties from Riemannian metrics though it seems they are very close to Riemannian metrics. Hilbert metric is the famous reversible Finsler metric of negative constant flag curvature in the history, and it is projectively flat. Then it is natural to ask the question how to classify reversible projectively flat Finsler metrics of constant flag curvature and give more new examples? In this paper, we answer the above question by giving the classification when the flag curvature respectively. Especially, for the case when , we show that the only reversible projectively flat Finsler metrics are just Hilbert metrics. For the case when , we give an algebraic way to construct explicit metric function by solving algebraic equations, such as by solving a quartic equation. When the flag curvature is zero, it is much easier to construct reversible projectively flat Finsler metrics than before. 相似文献