Isomorphy and dilatation in digraphs

DOI10.1515/apam-2014-5001zbMath1298.05143OpenAlexW2054605596MaRDI QIDQ2877573

Jamel Dammak

Publication date: 25 August 2014

Published in: Advances in Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/apam-2014-5001

zbMATH Keywords

dualdigraphdilatationsymmetric graphself-dualitytournamentisomorphyhemimorphyself-complementarity

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Finite orders which are reconstructible up to duality by their comparability graphs ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic

This page was built for publication: Isomorphy and dilatation in digraphs