Digraph isomorphism using subdigraph equivalent vertices and degree pair association.

zbMATH Open1474.05340MaRDI QIDQ4568181FDOQ4568181

Authors:

Publication date: 15 June 2018

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

zbMATH Keywords

orbitdegree paircard at \(v\)degree associated subdigraph equivalence problem (DASEP)similar 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)

Cited In (2)

• Title not available (Why is that?)
• On digraph reconstruction

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)