The maximum size of a nonhamiltonian graph with given order and connectivity
نویسندگان
چکیده
Motivated by work of Erdős, Ota determined the maximum size g(n,k) a k-connected nonhamiltonian graph order n in 1995. But for some pairs n,k, is not attained connectivity k. For example, g(15,3)=77 unique 7, 3. In this paper we obtain more precise information determining and k, extremal graphs. Consequently solve corresponding problem nontraceable
منابع مشابه
On maximum weight of a bipartite graph of given order and size
The weight of an edge xy of a graph is defined to be the sum of degrees of the vertices x and y. The weight of a graph G is the minimum of weights of edges of G. More than twenty years ago Erdős was interested in finding the maximum weight of a graph with n vertices and m edges. This paper presents a complete solution of a modification of the above problem in which a graph is required to be bip...
متن کاملThe Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree
In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs G with n vertices and ∆(G) ≤ r, which has the most complete subgraphs of size t, for t ≥ 3. The conjectured extremal graph is aKr+1 ∪Kb, where n = a(r + 1) + b with 0 ≤ b ≤ r. Gan, Loh, and Sudakov proved the conjecture wh...
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملOn the order and size of s-geodetic digraphs with given connectivity
A digraph G = (V, E) with diameter D is said to be s-geodetic, for 1 ≤ s ≤ D, if between any pair of (not necessarily different) vertices x, y ∈ V there is at most one x → y path of length ≤ s. Thus, any loopless digraph is at least 1-geodetic. A similar definition applies for a graph G, but in this case the concept is closely related to its girth g, for then G is s-geodetic with s = b(g − 1)/2...
متن کاملtoughness of the networks with maximum connectivity
the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113208