On the sum of the squares of all distances in bipartite graphs with given connectivity
type: Item
instance of: scholarly article
title: On the sum of the squares of all distances in bipartite graphs with given connectivity
zbMATH Open document ID: 1382.05020
author: Xianya Geng
author: Hongjin Zhao
published in: Discrete Applied Mathematics
publication date: 2018-03-21T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6851673
zbMATH Keywords: bipartite graph
zbMATH Keywords: vertex connectivity
zbMATH Keywords: edge connectivity
MaRDI profile type: Publication
full work available at URL: j.dam.2017.12.008
OpenAlex ID: W2788481607
cites work: Distance spectra of graphs: a survey
cites work: Q5422499
cites work: Q3144348
cites work: The edge-Wiener index of a graph
cites work: Wiener index of trees: Theory and applications
cites work: Q3144355
cites work: Q3655087
cites work: On the sum of all distances in bipartite graphs
cites work: On the variable Wiener indices of trees with given maximum degree
cites work: On ordinary and reverse Wiener indices of non-caterpillars
cites work: An edge version of the matrix-tree theorem and the wiener index
cites work: Edge-contributions of some topological indices and arboreality of molecular graphs
cites work: Q3144349
cites work: The Maximum Wiener Index of Trees with Given Degree Sequences
DOI: 10.1016/J.DAM.2017.12.008
description: scientific article; zbMATH DE number 6851673