Equivalent and strong equivalent graphs with application in clustering

zbMATH Open1410.05150MaRDI QIDQ4619906FDOQ4619906

Authors: Silviu Barza 

Publication date: 7 February 2019

Recommendations

• Some characterizations on clustering using equivalent graphs
• Clustering algorithm of graphs
• scientific article; zbMATH DE number 3907592
• Compatibility in a graph-theoretic setting
• scientific article; zbMATH DE number 3895108

zbMATH Keywords

clusteringisomorphic graphswalks matrix

Mathematics Subject Classification ID

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

Cited In (2)

• Strong cliques and equistability of EPT graphs
• Some characterizations on clustering using equivalent graphs

This page was built for publication: Equivalent and strong equivalent graphs with application in clustering

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