Some results on the reciprocal sum-degree distance of graphs

DOI10.1007/s10878-013-9645-5zbMath1325.05071WikidataQ59411392 ScholiaQ59411392MaRDI QIDQ498415

Xiaofeng Su, Xianglian Chen, Guifu Su, Limning Xiong

Publication date: 28 September 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9645-5

zbMATH Keywords

matching number; Cartesian product graphs; Harary index; join graphs; \(k\)-decomposition; reciprocal sum-degree distance

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C12: Distance in graphs

05C76: Graph operations (line graphs, products, etc.)

Related Items

Unnamed Item, Harary index of bipartite graphs, Unnamed Item, Comparison between Szeged indices of graphs, Further results on the reciprocal degree distance of graphs, Some extremal properties of the multiplicatively weighted Harary index of a graph, Embeddings into almost self-centered graphs of given radius, Note on extremal graphs with given matching number, On topological indices of graph transformation, Comparative study of distance-based graph invariants, On maximum Wiener index of trees and graphs with given radius

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the reciprocal degree distance of graphs
• Degree distance of unicyclic and bicyclic graphs
• On Harary index
• Ordering connected graphs having small degree distances
• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
• On Harary index of graphs
• The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs
• Trees with the seven smallest and eight greatest Harary indices
• Matching theory
• A survey of Nordhaus-Gaddum type relations
• Vertex-weightings for distance moments and thorny graphs
• NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS
• On Complementary Graphs
• Vertex-weighted Wiener polynomials for composite graphs
• Distance in graphs
• Reciprocal product-degree distance of graphs
• Wiener index of trees: Theory and applications