Fast algorithms for computing the characteristic polynomial of threshold and chain graphs (Q2333249): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:45, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for computing the characteristic polynomial of threshold and chain graphs |
scientific article |
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
