A decidability algorithm for strongly asymmetric graphs

MaRDI QIDQ2754528zbMATH OpenFDO

Authors Moise Cocan

Publication date 11 November 2001

zbMATH Keywords

decidability algorithmstrongly asymmetric graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On strongly asymmetric graphs
• scientific article; zbMATH DE number 872557
• Algorithmic aspects of algebraic methods for graph isomorphism testing
• scientific article; zbMATH DE number 701124
• Study of graph isomorphism by utilizing the concept of special degree of a vertex in a graph

Cited in

(2)

• On strongly asymmetric graphs
• On a class of strongly asymmetric PKA algorithms

This page was built for publication: A decidability algorithm for strongly asymmetric graphs

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