Clustering Vertex-Weighted Graphs by Spectral Methods
Spectral techniques are often used to partition the set of vertices of a graph, or to form clusters. They are based on the Laplacian matrix. These techniques allow easily to integrate weights on the edges. In this work, we introduce a <i>p</i>-Laplacian, or a generalized Laplacian matrix...
Enregistré dans:
Auteurs principaux: | Juan-Luis García-Zapata, Clara Grácio |
---|---|
Format: | article |
Langue: | EN |
Publié: |
MDPI AG
2021
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/c7d3a8b84b244797b620fbfb5420e7e8 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Vertex equitable labeling of union of cyclic snake related graphs
par: Jeyanthi,P., et autres
Publié: (2016) -
Vertex graceful labeling of some classes of graphs
par: Santhakumaran,A. P., et autres
Publié: (2018) -
Odd Vertex equitable even labeling of cyclic snake related graphs
par: Jeyanthi,P., et autres
Publié: (2018) -
A Note On The Partition Dimension of Thorn of Fan Graph
par: Auli Mardhaningsih
Publié: (2019) -
Some new classes of vertex-mean graphs
par: Lourdusamy,A., et autres
Publié: (2017)