On the sum of k-power of all distances in bipartite graphs

DOI10.13548/J.SXZZ.20170508.006zbMATH Open1399.05060MaRDI QIDQ4640693FDOQ4640693

Authors: Xianya Geng, Hongjin Zhao, Lili Xu 

Publication date: 25 May 2018

Recommendations

• On the sum of the squares of all distances in bipartite graphs.
• On the sum of the squares of all distances in bipartite graphs with given connectivity
• A short note on the sum of \(k\) largest distance eigenvalues of bipartite graphs
• scientific article; zbMATH DE number 912429
• On the sum of \(k\) largest distance eigenvalues of graphs

zbMATH Keywords

bipartite graphdiameterextremal graph

Mathematics Subject Classification ID

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

Cited In (2)

• The structure of \((k,l)\)-central sets and the value of \((k,l)\)-radii of complete bipartite graphs \(K_{1,n}\) and \(K_{2,n}\)
• Title not available (Why is that?)

This page was built for publication: On the sum of \(k\)-power of all distances in bipartite graphs

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