Forestal algebras and algebraic forests (on a new class of weakly compact graphs)

DOI10.1016/S0012-365X(00)00152-7zbMath0962.05041OpenAlexW1983221116MaRDI QIDQ1591143

Gottfried Tinhofer, Sergei Evdokimov, Ilya Nikolaevich Ponomarenko

Publication date: 4 June 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00152-7

zbMATH Keywords

cellular algebrasstrong isomorphismalgebraic forestsforest algebras

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (11)

Bases of Schurian antisymmetric coherent configurations and an isomorphism test for Schurian tournaments ⋮ Graph isomorphism, color refinement, and compactness ⋮ On Tinhofer’s Linear Programming Approach to Isomorphism Testing ⋮ Jordan-like characterization of automorphism groups of planar graphs ⋮ The Weisfeiler-Leman dimension of distance-hereditary graphs ⋮ Higmanian rank-5 association schemes on 40 points ⋮ The Weisfeiler-Leman algorithm and recognition of graph properties ⋮ The Weisfeiler-Leman algorithm and recognition of graph properties ⋮ Permutation group approach to association schemes ⋮ Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm ⋮ Canonisation and Definability for Graphs of Bounded Rank Width

This page was built for publication: Forestal algebras and algebraic forests (on a new class of weakly compact graphs)