REVIEW
Reverse degree distance of unicyclic graphs
Not yet reviewed by Pith; the record is open.
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
Reverse degree distance of unicyclic graphs
classification
math.CO
keywords
degreedistancereversegraphsmaximumunicyclicchemistryclosely
read the original abstract
The reverse degree distance is a connected graph invariant closely related to the degree distance proposed in mathematical chemistry. We determine the unicyclic graphs of given girth, number of pendant vertices and maximum degree, respectively, with maximum reverse degree distances.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.