Graph recurrence

DOI10.1016/S0195-6698(02)00136-1MaRDI QIDQ1869026zbMATH OpenOpenAlexFDO

Authors 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

adjacency matrixrecurrenceisomorphism

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)

Recommendations

• Graph algebras and the graph isomorphism problem
• Graph isomorphism problem in terms of probability propagation matrix invariance criterion by using ITCPP
• scientific article; zbMATH DE number 3841910
• On sequences of polynomials arising from graph invariants
• Study of graph isomorphism by utilizing the concept of special degree of a vertex in a graph

Cites work

• scientific article; zbMATH DE number 3851135 (Why is no real title available?)
• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• An Efficient Algorithm for Graph Isomorphism
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Random Graph Isomorphism
• Separation index of a graph

Cited in

(3)

• A recurrence template for several parameters in series-parallel graphs
• Repetitions in graphs and sequences
• Diffusion determines the recurrent graph

This page was built for publication: Graph recurrence

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