Extremal Wiener Index of Graphs with Given Number of Vertices of Odd Degree

Wiener index Connectivity
DOI: 10.46793/match.89-2.503s Publication Date: 2022-08-15T07:43:34Z
ABSTRACT
The Wiener index of a connected graph is the sum distances between all pairs vertices.Let G(n, 2k) be set graphs on n vertices with exactly 2k odd degree.G(n, 0) just Eulerian vertices.In Gutman et al. (2014) and Dankelmann (2021), authors characterized first four minimum two maximum index.In paper, we characterize in for 0 ≤ k 2 , 2) first-maximum secondmaximum index.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (0)
CITATIONS (2)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....