On the number of matchings of graphs formed by a graph operation (Q867792)
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 5127950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of matchings of graphs formed by a graph operation |
scientific article; zbMATH DE number 5127950 |
Statements
On the number of matchings of graphs formed by a graph operation (English)
0 references
16 February 2007
0 references
Hosoya index
0 references
matching polynomial
0 references
oriented incident matrix
0 references
skew adjacency matrix
0 references
degree sequence
0 references
0 references
0.92776364
0 references
0.91632664
0 references
0 references
0.90627193
0 references
0.9032197
0 references
0.90030265
0 references
0 references
