Degree distance of unicyclic graphs

From MaRDI portal



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.












This page was built for publication: Degree distance of unicyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5412670)