On the nullity and the matching number of unicyclic graphs (Q837008)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the nullity and the matching number of unicyclic graphs |
scientific article; zbMATH DE number 5602611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the nullity and the matching number of unicyclic graphs |
scientific article; zbMATH DE number 5602611 |
Statements
On the nullity and the matching number of unicyclic graphs (English)
0 references
10 September 2009
0 references
unicyclic graph
0 references
nullity
0 references
matching number
0 references
perfect matching
0 references
characteristic polynomial
0 references
0 references
0.95270073
0 references
0.94085073
0 references
0 references
0.9362465
0 references
0.9313106
0 references
0.9265853
0 references
0.9205655
0 references
0.91931856
0 references
0 references
