Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number. (Q2828965)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6644174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number. |
scientific article; zbMATH DE number 6644174 |
Statements
26 October 2016
0 references
graph
0 references
algebraic connectivity
0 references
matching number
0 references
edge covering number
0 references
Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number. (English)
0 references
0.8684154748916626
0 references
0.8442016243934631
0 references
0.8338525295257568
0 references
0.7964206337928772
0 references
0.7932400107383728
0 references
