Graph recurrence

DOI10.1016/S0195-6698(02)00136-1zbMath1022.05051OpenAlexW2912902786MaRDI QIDQ1869026

Andrew Vince

Publication date: 9 April 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(02)00136-1

zbMATH Keywords

recurrenceadjacency matrixisomorphism

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Separation index of a graph
• Random Graph Isomorphism
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• An Efficient Algorithm for Graph Isomorphism

This page was built for publication: Graph recurrence