Similarity matrices for colored graphs

zbMath1227.05180MaRDI QIDQ1043704

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

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

Related Items (3)

Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs ⋮ Beyond non-backtracking: non-cycling network centrality measures ⋮ Dynamic Katz and related network measures

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