The extremal graph of given the number of cut vertex having minimal EDS

zbMATH Open1399.05126MaRDI QIDQ4641328FDOQ4641328

Authors: Yong Lei, Aimin Yang, Liying Yang 

Publication date: 25 May 2018

Recommendations

• Further results on the eccentric distance sum
• Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
• On the extremal values of the eccentric distance sum of trees with a given maximum degree
• scientific article; zbMATH DE number 7029068
• scientific article; zbMATH DE number 7478529

zbMATH Keywords

distanceextremal graphcut vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

This page was built for publication: The extremal graph of given the number of cut vertex having minimal EDS

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