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...
Guardado en:
Autores principales: | Juan-Luis García-Zapata, Clara Grácio |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
MDPI AG
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/c7d3a8b84b244797b620fbfb5420e7e8 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Vertex equitable labeling of union of cyclic snake related graphs
por: Jeyanthi,P., et al.
Publicado: (2016) -
Vertex graceful labeling of some classes of graphs
por: Santhakumaran,A. P., et al.
Publicado: (2018) -
Odd Vertex equitable even labeling of cyclic snake related graphs
por: Jeyanthi,P., et al.
Publicado: (2018) -
A Note On The Partition Dimension of Thorn of Fan Graph
por: Auli Mardhaningsih
Publicado: (2019) -
Some new classes of vertex-mean graphs
por: Lourdusamy,A., et al.
Publicado: (2017)