\((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets

DOI10.1007/S00373-018-02005-YzbMath1409.05127OpenAlexW2910452895MaRDI QIDQ1741582

Hamza Si Kaddour, Jamel Dammak

Publication date: 3 May 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-02005-y

zbMATH Keywords

Boolean sum(\(-1)\)-hypomorphy3-element homogeneous subsets

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Reconstruction of a coloring from its homogeneous sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Hypomorphy of graphs up to complementation
• Boolean sum of graphs and reconstruction up to complementation
• Graph reconstruction—a survey
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem

This page was built for publication: \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets