A unified method for eigendecomposition of graph products (Q5463616): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56688310, #quickstatements; #temporary_batch_1712111774907
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient method for decomposition of regular structures using graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3985900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral bisection of adaptive finite element meshes for parallel processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral trisection of finite element models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kronecker Product of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New canonical forms for analytical solution of problems in structural mechanics / rank
 
Normal rank

Latest revision as of 13:55, 10 June 2024

scientific article; zbMATH DE number 2192612
Language Label Description Also known as
English
A unified method for eigendecomposition of graph products
scientific article; zbMATH DE number 2192612

    Statements

    A unified method for eigendecomposition of graph products (English)
    0 references
    5 August 2005
    0 references
    adjacency
    0 references
    Laplacian
    0 references
    Cartesian product
    0 references
    strong Cartesian product
    0 references
    direct product
    0 references
    regular graph
    0 references
    0 references
    0 references

    Identifiers