Fast algorithms for computing the characteristic polynomial of threshold and chain graphs (Q2333249): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q130025481, #quickstatements; #temporary_batch_1725406550273
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Slobodan K. Simic / rank
Normal rank
 
Property / author
 
Property / author: Slobodan K. Simic / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Eigenvalue location for chain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial approach for computing the characteristic polynomial of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs for which the least eigenvalue is minimal. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs for which the least eigenvalue is minimal. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the first eigenvalue of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs obtained by a generalization of the join graph operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3642517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Graph Limits and Random Threshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of the Characteristic Polynomial of a Threshold Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new graph product and its spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Characteristic Polynomial of Threshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3594054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank
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
    0 references
    0 references
    0 references
    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

    Identifiers