Graph homomorphisms through random walks

DOI10.1002/jgt.10125zbMath1030.60061OpenAlexW4252351690MaRDI QIDQ4434546

Hossein Hajiabolhassan, Amir Daneshgar

Publication date: 10 November 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10125

zbMATH Keywords

Markov chainsgraph colouringgraph homomorphismgraph spectra

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (7)

Circular colouring and algebraic no-homomorphism theorems ⋮ Graph homomorphisms and nodal domains ⋮ Density and power graphs in graph homomorphism problem ⋮ Bounds for visual cryptography schemes ⋮ On the isoperimetric spectrum of graphs and its approximations ⋮ On colorings of graph powers ⋮ On cylindrical graph construction and its applications

Cites Work

• Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
• Interlacing eigenvalues and graphs
• Matrix Analysis
• Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph homomorphisms through random walks