Fast algorithms for computing the characteristic polynomial of threshold and chain graphs (Q2333249)
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: Fast algorithms for computing the characteristic polynomial of threshold and chain graphs |
scientific article; zbMATH DE number 7128608
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for computing the characteristic polynomial of threshold and chain graphs |
scientific article; zbMATH DE number 7128608 |
Statements
Fast algorithms for computing the characteristic polynomial of threshold and chain graphs (English)
0 references
12 November 2019
0 references
adjacency matrix
0 references
characteristic polynomial
0 references
graph divisor
0 references
threshold graph
0 references
chain graph
0 references
lexicographic product
0 references
0.9097530841827391
0 references
0.8966085314750671
0 references
0.8951781988143921
0 references
0.7946763038635254
0 references
0.7929234504699707
0 references
