Lower bounds of distance Laplacian spectral radii of n-vertex graphs in terms of matching number

2016 ◽  
Vol 506 ◽  
pp. 579-587 ◽  
Author(s):  
Fenglei Tian ◽  
Dein Wong ◽  
Xiaobin Ma
Keyword(s):  
Lower Bounds ◽  
Matching Number

Lower bounds of graph energy in terms of matching number

2018 ◽  
Vol 549 ◽  
pp. 276-286 ◽  
Author(s):  
Dein Wong ◽  
Xinlei Wang ◽  
Rui Chu
Keyword(s):  
Lower Bounds ◽  
Matching Number ◽  
Graph Energy

scholarly journals Tight lower bounds on the matching number in a graph with given maximum degree

2018 ◽  
Vol 89 (2) ◽  
pp. 115-149 ◽  
Author(s):  
Michael A. Henning ◽  
Anders Yeo
Keyword(s):  
Lower Bounds ◽  
Maximum Degree ◽  
Matching Number

Interval Packing and Covering in the Boolean Lattice

1996 ◽  
Vol 5 (4) ◽  
pp. 373-384 ◽  
Author(s):  
Konrad Engel
Keyword(s):  
Lower Bounds ◽  
Pairwise Disjoint ◽  
Boolean Lattice ◽  
Covering Number ◽  
Matching Number ◽  
Packing And Covering ◽  
Minimum Number ◽  
Fractional Numbers

Let be the hypergraph whose points are the subsets X of [n] := {1,…,n} with l≤ |X| ≤ u, l < u, and whose edges are intervals in the Boolean lattice of the form I = {C ⊆[n] : X⊆C⊆Y} where |X| = l, |Y| = u, X ⊆ Y.We study the matching number i.e. the the maximum number of pairwise disjoint edges, and the covering number i.e. the minimum number of points which cover all edges. We prove that max and that for every ε > 0 the inequalities hold, where for the lower bounds we suppose that n is not too small. The corresponding fractional numbers can be determined exactly. Moreover, we show by construction that

scholarly journals On Lower Bounds for the Matching Number of Subcubic Graphs

2016 ◽  
Vol 85 (2) ◽  
pp. 336-348 ◽  
Author(s):  
P. E. Haxell ◽  
A. D. Scott
Keyword(s):  
Lower Bounds ◽  
Matching Number ◽  
Subcubic Graphs

Lower Bounds on the Uniquely Restricted Matching Number

2019 ◽  
Vol 35 (1) ◽  
pp. 353-361 ◽  
Author(s):  
M. Fürst ◽  
D. Rautenbach
Keyword(s):  
Lower Bounds ◽  
Matching Number

scholarly journals Sharp lower bounds on the fractional matching number

2015 ◽  
Vol 186 ◽  
pp. 272-274 ◽  
Author(s):  
Roger E. Behrend ◽  
Suil O ◽  
Douglas B. West
Keyword(s):  
Lower Bounds ◽  
Matching Number

Sharp lower bounds on the sum-connectivity index of trees

2021 ◽  
Author(s):  
S. Alyar ◽  
R. Khoeilar
Keyword(s):  
Lower Bounds ◽  
Domination Number ◽  
Extremal Problems ◽  
Connectivity Index ◽  
Matching Number ◽  
Extremal Graphs ◽  
Extremal Values

The sum-connectivity index of a graph [Formula: see text] is defined as the sum of weights [Formula: see text] over all edges [Formula: see text] of [Formula: see text], where [Formula: see text] and [Formula: see text] are the degrees of the vertices [Formula: see text] and [Formula: see text] in [Formula: see text], respectively. In this paper, some extremal problems on the sum-connectivity index of trees are studied. The extremal values on the sum-connectivity index of trees with given graphic parameters, such as pendant number, matching number, domination number and diameter, are determined. The corresponding extremal graphs are characterized, respectively.

Sign in / Sign up

Export Citation Format

Share Document