Pith. sign in

REVIEW

Triangle-degree and triangle-distinct graphs

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 2308.10978 v2 pith:3RQZAGYW submitted 2023-08-21 math.CO

Zhanar Berikkyzy , Beth Bjorkman , Heather Smith Blake , Sogol Jahanbekam , Lauren Keough , Kevin Moss , Danny Rorabaugh , Songling Shan This is my paper · ORCID
classification math.CO
keywords graphstriangle-degreevertexeverygraphpropertyconstructcontain
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex has a distinct triangle-degree. In this paper, we construct an infinite family of graphs with this property. We also study the vertex degrees and size of graphs with this property.

Discussion (0). Continue with ORCID to comment.

Pith tools