Isomorphisms of Connected Cayley Digraphs
Copyright policy )Isomorphisms of Connected Cayley Digraphs
A Cayley graph \(X(G;S)\) on a finite group \(G\) is said to be a CI-graph if for any \(T\subset G\), \(S=\alpha(T)\) for some \(\alpha\in \Aut(G)\) only when \(X(G;S)\cong X(G;T)\). The author investigates minimal Cayley graphs on abelian groups with respect to being CI-graphs, and isomorphisms of connected Cayley graphs on groups which are abelian, nilpotent, or of odd order.
- University of Western Australia Australia
CI-graph, isomorphism, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), Directed graphs (digraphs), tournaments, Cayley graph, Graphs and abstract algebra (groups, rings, fields, etc.)
CI-graph, isomorphism, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), Directed graphs (digraphs), tournaments, Cayley graph, Graphs and abstract algebra (groups, rings, fields, etc.)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!