Pith. sign in

REVIEW

Graphs with few trivial characteristic ideals

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

Carlos A. Alfaro , Michael D. Barrus , John Sinkovic , Ralihe R. Villagrán This is my paper · ORCID
classification math.CO
keywords graphscharacterizationequalfactorsinvariantgroupssmithwhose
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools