Representing Groups on Graphs

DOI10.1007/978-3-642-03816-7_26zbMath1250.05058arXiv0904.3941OpenAlexW2165911606MaRDI QIDQ3182934

Sagarmoy Dutta, Piyush P. Kurur

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.3941

zbMATH Keywords

generatorspermutation groupsTuring reducibilitygraph isomorphismabelian group representabilityno polynomial time algoirthmrepresentability problemsolvable group representability

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Representation theory of groups (20C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Subgroups of minimal index in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph isomorphism is low for PP
• A note on the graph isomorphism counting problem
• Graph Isomorphism is in SPP

This page was built for publication: Representing Groups on Graphs