Triangle-degree and triangle-distinct graphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3RQZAGYWrecord.jsonopen to challenge →
classification
math.CO
keywords
graphstriangle-degreevertexeverygraphpropertyconstructcontain
read the original 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.
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.