On the \4,-k\-hypomorphy for digraphs.

zbMATH Open1413.05137MaRDI QIDQ2829079FDOQ2829079

Authors: Jamel Dammak 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• The \((\leq 5)\)-hypomorphy of digraphs up to complementation
• \((\leq k)\)-hereditarily reconstructible digraphs
• Hereditary hemimorphy of \(\{ 5,-4\}\)-hemimorphic arc connected digraphs.
• Are all pairs of hypomorphic digraphs \(S\)-isomorphic?
• Hypomorphy of graphs up to complementation

zbMATH Keywords

reconstructiondigraphtournamentisomorphyhereditary isomorphyhypomorphy

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cited In (9)

• Hereditary hemimorphy of \(\{ 5,-4\}\)-hemimorphic arc connected digraphs.
• Are all pairs of hypomorphic digraphs \(S\)-isomorphic?
• Morphology of the connected components of the Boolean sum of two digraphs \((\le 5)\)-hypomorphic up to complementation
• \((\leq k)\)-hereditarily reconstructible digraphs
• On the contractibility of a digraph onto \(K_ 4^*\)
• Some results on 4-transitive digraphs
• Characterization of the \((\leq 3)\)-hypomorphy classes with the aid of interdictions
• An isomorphism theorem for digraphs
• The \((\leq 5)\)-hypomorphy of digraphs up to complementation

This page was built for publication: On the \(\{4,-k\}\)-hypomorphy for digraphs.

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