On bipartite graphs having minimum fourth adjacency coefficient (Q2117523)
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 bipartite graphs having minimum fourth adjacency coefficient |
scientific article; zbMATH DE number 7493901
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On bipartite graphs having minimum fourth adjacency coefficient |
scientific article; zbMATH DE number 7493901 |
Statements
On bipartite graphs having minimum fourth adjacency coefficient (English)
0 references
21 March 2022
0 references
Sachs subgraph
0 references
matching
0 references
characteristic polynomial
0 references
Young matrix
0 references
partitions of positive integers
0 references
0.888170063495636
0 references
0.7382344603538513
0 references
0.7164893746376038
0 references
0.7063990235328674
0 references
0.7060461640357971
0 references
