Fast algorithms for computing the characteristic polynomial of threshold and chain graphs (Q2333249): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q130025481, #quickstatements; #temporary_batch_1725406550273 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130025481 / rank | |||
Normal rank | |||
Latest revision as of 00:35, 4 September 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
