Degree resistance distance of trees with some given parameters

DOI10.22108/toc.2018.108656.1538zbMath1463.05135OpenAlexW2897335412MaRDI QIDQ5135471

Fangguo He, Xinnong Jiang

Publication date: 20 November 2020

Full work available at URL: https://doaj.org/article/6dd14f6f0c0f47e9a1300d50baa2340c

zbMATH Keywords

diametertreescovering numberdegree resistance distance

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Cites Work

• On degree resistance distance of cacti
• The Kirchhoff indexes of some composite networks
• On maximum Estrada indices of bipartite graphs with some given parameters
• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• The Estrada index of trees
• Ordering connected graphs having small degree distances
• The unicyclic graphs with maximum degree resistance distance
• On the degree distance of unicyclic graphs with given matching number
• On the degree distance of a graph
• On resistance-distance and Kirchhoff index
• Properties of connected graphs having minimum degree distance
• Wiener index of hexagonal systems
• The degree resistance distance of cacti
• Degree distance and vertex-connectivity
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item