Search for a unique incidence matrix of a graph

DOI10.1007/BF01932948zbMath0285.05126OpenAlexW2160377493MaRDI QIDQ4770988

Andrzej Proskurowski

Publication date: 1974

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932948

Mathematics Subject Classification ID

Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (3)

A new algorithm for digraph isomorphism ⋮ Canonical incidence matrices of graphs ⋮ Algorithms for finding directed graph isomorphisms by finite automata

Cites Work

• Unnamed Item
• A Backtrack Procedure for Isomorphism of Directed Graphs
• An Efficient Algorithm for Graph Isomorphism
• An algorithm for determining the automorphism partitioning of an undirected graph
• Depth-First Search and Linear Graph Algorithms
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism

This page was built for publication: Search for a unique incidence matrix of a graph