Similarity matrices for colored graphs

MaRDI QIDQ1043704zbMATH OpenFDO

Authors Catherine Fraikin, Paul van Dooren

Publication date 9 December 2009

Published in Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.bbms/1257776243

zbMATH Keywords

algorithmsgraph theorygraph algorithmseigenvalues of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Eigenvalues, singular values, and eigenvectors (15A18) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 2038751
• scientific article; zbMATH DE number 2209434
• Simultaneous embedding of colored graphs
• Graph similarity and approximate isomorphism
• Colored graph homomorphisms
• Colorings and orientations of matrices and graphs
• Graph similarity and distance in graphs
• Graph similarity scoring and matching
• Color-distance in color-connected graphs

Cited in

(6)

• Low rank estimation of similarities on graphs
• Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
• Iterative methods for low rank approximation of graph similarity matrices
• Computational Science and Its Applications – ICCSA 2004
• Dynamic Katz and related network measures
• Beyond non-backtracking: non-cycling network centrality measures

This page was built for publication: Similarity matrices for colored graphs

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