Laplacian: The Laplacian of a graph

In graphpcor: Models for Correlation Matrices Based on Graphs

The Laplacian of a graph

Description

The (symmetric) Laplacian of a graph is a square matrix with dimention equal the number of nodes. It is defined as

L_{ij} = n_i \textrm{ if } i=j, -1 \textrm{ if } i\sim j, 0 \textrm{ otherwise}

where i~j means that there is an edge between nodes i and j and n_i is the number of edges including node i.

Usage

Laplacian(graph)

## Default S3 method:
Laplacian(graph)

## S3 method for class 'matrix'
Laplacian(graph)

Arguments

graph

an object that inherits a matrix class

Value

matrix as the Laplacian of a graph

Methods (by class)

• Laplacian(default): The Laplacian default method (none)

• Laplacian(matrix): The Laplacian of a matrix

graphpcor documentation built on June 8, 2025, 10:37 a.m.