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.
Recommendations
Cited in
(18)- Degree condition for subdivisions of unicyclic graphs
- On eccentric distance sum and degree distance of graphs
- Extremal graphs with respect to two distance-based topological indices
- Degree distance of unicyclic graphs with given matching number
- Unicyclic and bicyclic graphs having minimum degree distance
- Status connectivity indices of line graphs
- Maximum degree distance of graphs with exactly two cycles
- ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS
- On the reciprocal degree distance of graphs
- On reverse degree distance of unicyclic graphs
- Calculating the degree distance of partial Hamming graphs
- Gutman index of some derived graphs
- Splices, links, and their edge-degree distances
- Degree distance of unicyclic and bicyclic graphs
- scientific article; zbMATH DE number 5031511 (Why is no real title available?)
- Further properties on the degree distance of graphs
- The unicyclic graphs with maximum degree resistance distance
- On the degree distance of unicyclic graphs with given matching number
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)