On the sum of all distances in bipartite graphs
From MaRDI portal
Publication:2449069
DOI10.1016/j.dam.2013.12.010zbMath1288.05072OpenAlexW2068725044MaRDI QIDQ2449069
Publication date: 6 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.12.010
Related Items (32)
On the maximal connective eccentricity index of bipartite graphs with some given parameters ⋮ Further results on the expected hitting time, the cover cost and the related invariants of graphs ⋮ On the extreme eccentric distance sum of graphs with some given parameters ⋮ On the further relation between the (revised) Szeged index and the Wiener index of graphs ⋮ Sizes and transmissions of digraphs with a given clique number ⋮ Maximum \(H\)-index of bipartite network with some given parameters ⋮ On connected graphs having the maximum connective eccentricity index ⋮ Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications ⋮ Topological Efficiency of Some Product Graphs ⋮ On extremal bipartite graphs with a given connectivity ⋮ On the difference between the (revised) Szeged index and the Wiener index of cacti ⋮ Extremal hitting times of trees with some given parameters ⋮ On extremal cacti with respect to the revised Szeged index ⋮ Edge-grafting transformations on the average eccentricity of graphs and their applications ⋮ On the sum of the squares of all distances in bipartite graphs with given connectivity ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ On extremal cacti with respect to the Szeged index ⋮ On the extremal total reciprocal edge-eccentricity of trees ⋮ On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum ⋮ Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum ⋮ Some topological indices and graph properties ⋮ Wiener index, Harary index and graph properties ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond ⋮ Further results on the reciprocal degree distance of graphs ⋮ On the extremal graphs with respect to the total reciprocal edge-eccentricity ⋮ Extremal cover cost and reverse cover cost of trees with given segment sequence ⋮ On the edge-Szeged index of unicyclic graphs with given diameter ⋮ On extremal bipartite graphs with given number of cut edges ⋮ Harary index of bipartite graphs ⋮ On the minimum eccentric distance sum of bipartite graphs with some given parameters ⋮ On the reformulated reciprocal sum-degree distance of graph transformations
Cites Work
- 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
- Wiener index of hexagonal systems
- Distance distributions for graphs modeling computer networks
- Edge-contributions of some topological indices and arboreality of molecular graphs
- An edge version of the matrix-tree theorem and the wiener index
- On the sum of all distances in a graph or digraph
- Distance in graphs
- The Maximum Wiener Index of Trees with Given Degree Sequences
- Wiener index of trees: Theory and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the sum of all distances in bipartite graphs
