Some characterizations on clustering using equivalent graphs

MaRDI QIDQ4619895zbMATH OpenFDO

Authors Silviu Barza

Publication date 7 February 2019

zbMATH Keywords

clusteringismorphic graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75) Derivative securities (option pricing, hedging, etc.) (91G20)

Recommendations

• Equivalent and strong equivalent graphs with application in clustering
• Compatibility in a graph-theoretic setting
• A new approach to clustering
• scientific article; zbMATH DE number 3907592
• Clustering algorithm of graphs

Cited in

(1)

• Equivalent and strong equivalent graphs with application in clustering

This page was built for publication: Some characterizations on clustering using equivalent graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4619895)