On the power of a perturbation for testing non-isomorphism of graphs

DOI10.1007/BF02136028MaRDI QIDQ797996zbMATH OpenOpenAlexFDO

Authors G. M. Prabhu, Narsingh Deo

Publication date 1984

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02136028

zbMATH Keywords

characteristic polynomialgraph perturbationreconstruction conjecturenon-isomorphism of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On formal products and angle matrices of a graph
• scientific article; zbMATH DE number 4154487
• Seeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive results
• scientific article; zbMATH DE number 125495
• The polynomial reconstruction problem: the first 50 years

Cites work

• scientific article; zbMATH DE number 3446921 (Why is no real title available?)
• A congruence theorem for trees
• Cospectral Graphs and Digraphs
• Graph reconstruction—a survey
• Spektren endlicher Grafen

Cited in

(4)

• On the characteristic polynomial of the power of a path
• On one test for the switching separability of graphs modulo q
• The characteristic polynomials of modified graphs
• scientific article; zbMATH DE number 3968624 (Why is no real title available?)

This page was built for publication: On the power of a perturbation for testing non-isomorphism of graphs

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