Digraph isomorphism using subdigraph equivalent vertices and degree pair association.

MaRDI QIDQ4568181zbMATH OpenFDO

Authors

Publication date 15 June 2018

zbMATH Keywords

card at \(v\)degree associated subdigraph equivalence problem (DASEP)degree pairorbitsimilar vertices

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 1136782
• scientific article; zbMATH DE number 7478566
• Reconstructing Digraphs from Partial Dadecks
• On digraph reconstruction
• A property of most of the known non-reconstructible digraphs

Cited in

(2)

• On digraph reconstruction
• scientific article; zbMATH DE number 4162908 (Why is no real title available?)

This page was built for publication: Digraph isomorphism using subdigraph equivalent vertices and degree pair association.

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