The Moore-Penrose inverse of the normalized graph Laplacian (Q2435511): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2013.08.039 / 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.laa.2013.08.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993126681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized inverses. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commute times for a directed graph using an asymmetric Laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3060857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Effective Resistance of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pseudo-inverse of the Laplacian of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Laplacian and the Degree of Asymmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096714 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2013.08.039 / rank
 
Normal rank

Latest revision as of 15:10, 18 December 2024

scientific article
Language Label Description Also known as
English
The Moore-Penrose inverse of the normalized graph Laplacian
scientific article

    Statements

    The Moore-Penrose inverse of the normalized graph Laplacian (English)
    0 references
    0 references
    19 February 2014
    0 references
    Moore-Penrose generalized inverse
    0 references
    graph Laplacian
    0 references
    undirected graph
    0 references
    directed graph
    0 references

    Identifiers