Clustering for metric graphs using the \(p\)-Laplacian

DOI10.1307/mmj/1472066142zbMath1348.05122OpenAlexW2512437579MaRDI QIDQ333250

Leandro M. Del Pezzo, Julio D. Rossi

Publication date: 28 October 2016

Published in: Michigan Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1307/mmj/1472066142

zbMATH Keywords

quantum graphclustering problem in a metric graph

Mathematics Subject Classification ID

Nonlinear eigenvalue problems and nonlinear spectral theory for PDEs (35P30) Degenerate elliptic equations (35J70) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Quasilinear elliptic equations with (p)-Laplacian (35J92)

Related Items (5)

A theory of spectral partitions of metric graphs ⋮ The Cheeger cut and Cheeger problem in metric graphs ⋮ The discrete \(p\)-Schrödinger equations under the mixed boundary conditions on networks ⋮ On the eigenvalues for a weighted p-Laplacian operator on metric graphs ⋮ Unnamed Item

This page was built for publication: Clustering for metric graphs using the \(p\)-Laplacian