A lower bound on the degree distance in a tree

zbMATH Open1221.05043MaRDI QIDQ3577609FDOQ3577609

Authors: Zhijun Guo, Shubo Chen 

Publication date: 22 July 2010

Full work available at URL: http://www.m-hikari.com/ijcms-2010/13-16-2010/index.html

Recommendations

• Bounds for degree distance of a graph
• On the degree distance of a graph
• The degree distance of certain particular graphs
• On some degree-and-distance-based graph invariants of trees
• Some extremal properties of the degree distance of a graph

zbMATH Keywords

distancediameterdegree distancedouble star-like tree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Cited In (11)

• Title not available (Why is that?)
• Calculating the degree distance of partial Hamming graphs
• Upper bounds on product degree distance of \(F\)-sum of graphs
• Degree distance and Gutman index of two graph products
• Bounds for degree distance of a graph
• Some extremal properties of the degree distance of a graph
• The degree distance of certain particular graphs
• Two upper bounds for the degree distances of four sums of graphs
• A lower bound for tree resolution
• On Steiner degree distance of trees
• Some relations between distance-based polynomials of trees

This page was built for publication: A lower bound on the degree distance in a tree

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