Fast algorithms for computing the characteristic polynomial of threshold and chain graphs (Q2333249): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2018.03.024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2796075553 / rank | |||
Normal rank | |||
Revision as of 01:46, 20 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
