d-cluster-free sets with a given matching number
نویسندگان
چکیده
منابع مشابه
The Harmonic Index of Unicyclic Graphs with given Matching Number
The harmonic index of a graph G is defined as the sum of weights 2 d(u)+d(v) of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G, respectively. In this paper, we determine the graph with minimum harmonic index among all unicyclic graphs with a perfect matching. Moreover, the graph with minimum harmonic index among all unicyclic graphs with a given matching num...
متن کاملThe Laplacian spectral radius of graphs with given matching number
In this paper, we show that of all graphs of order n with matching number β, the graphs with maximal spectral radius are Kn if n = 2β or 2β + 1; K2β+1 ∪Kn−2β−1 if 2β + 2 n < 3β + 2; Kβ ∨ Kn−β or K2β+1 ∪Kn−2β−1 if n = 3β + 2; Kβ ∨ Kn−β if n > 3β + 2, where Kt is the empty graph on t vertices. © 2006 Elsevier Inc. All rights reserved. AMS classification: 05C35; 05C50
متن کاملThe Minimal Matching Energy of (n,m)-Graphs with a Given Matching Number
The matching energy of a graph is defined as the sum of the absolute values of the zeros of its matching polynomial. Let Gn,m be the set of connected graphs of order n and with m edges. In this note we determined the extremal graphs from Gn,m with n ≤ m ≤ 2n−4 minimizing the matching energy. Also we determined the minimal matching energy of graphs from Gn,m where m = n−1+t and 1 ≤ t ≤ β−1 and w...
متن کاملOn the maximum number of edges in a hypergraph with given matching number
The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max {(3s+ 2 3 ) , ( n 3 ) − ( n− s 3 )} for all n, s, n ≥ 3s+ 2.
متن کاملTHE NUMBER OF Bh-SETS OF A GIVEN CARDINALITY
For any integer h > 2, a set A of integers is called a Bh-set if all sums a1 + . . . + ah, with a1, . . . , ah ∈ A and a1 6 . . . 6 ah, are distinct. We obtain essentially sharp asymptotic bounds for the number of Bh-sets of a given cardinality that are contained in the interval {1, . . . , n}. As a consequence of these bounds, we determine, for any integer m 6 n, the cardinality of the largest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2019
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2019.103000