On the sum of the squares of all distances in bipartite graphs with given connectivity
From MaRDI portal
Publication:1706137
DOI10.1016/j.dam.2017.12.008zbMath1382.05020OpenAlexW2788481607MaRDI QIDQ1706137
Publication date: 21 March 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.12.008
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the variable Wiener indices of trees with given maximum degree
- On ordinary and reverse Wiener indices of non-caterpillars
- The edge-Wiener index of a graph
- Distance spectra of graphs: a survey
- On the sum of all distances in bipartite graphs
- Edge-contributions of some topological indices and arboreality of molecular graphs
- An edge version of the matrix-tree theorem and the wiener index
- The Maximum Wiener Index of Trees with Given Degree Sequences
- Wiener index of trees: Theory and applications
This page was built for publication: On the sum of the squares of all distances in bipartite graphs with given connectivity