Abstract
The isomorphism problem is not known to be NP-complete nor polynomial. Yet it is crucial when maintaining large conceptual graphs databases. Taking advantage of conceptual graphs specificities, whenever, by means of structural functions, a linear order of the conceptual nodes of a conceptual graph G can be computed as invariant under automorphism, a descriptor is assigned to G in such a way that any other conceptual graph isomorphic to G has the same descriptor and conversely. The class of conceptual graphs for which the linear ordering of the conceptual nodes succeeds is compared to other relevant classes, namely those of locally injective, C-rigid and irredundant conceptual graphs. Locally injective conceptual graphs are proved to be irredundant, thus linearly ordered by the specialization relation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
