The reviewed record of science sign in
Pith

arxiv: 2004.00172 · v1 · pith:B2QMJMLG · submitted 2020-04-01 · math.CO

Graphs with few trivial characteristic ideals

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:B2QMJMLGrecord.jsonopen to challenge →

classification math.CO
keywords graphscharacterizationequalfactorsinvariantgroupssmithwhose
0
0 comments X
read the original abstract

We give a characterization of the graphs with at most three trivial characteristic ideals. This implies the complete characterization of the regular graphs whose critical groups have at most three invariant factors equal to 1 and the characterization of the graphs whose Smith groups have at most 3 invariant factors equal to 1. We also give an alternative and simpler way to obtain the characterization of the graphs whose Smith groups have at most 3 invariant factors equal to 1, and a list of minimal forbidden graphs for the family of graphs with Smith group having at most 4 invariant factors equal to 1.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.