Distance-unbalancedness of graphs
From MaRDI portal
Publication:2243233
Recommendations
Cites work
- -distance-balanced graphs
- A lower bound for the first Zagreb index and its application
- Bipartite graphs with balanced (a,b)-partitions
- Distance-balanced graphs
- scientific article; zbMATH DE number 7410339 (Why is no real title available?)
- Maximal Wiener index for graphs with prescribed number of blocks
- Mostar index
- On 2-distance-balanced graphs
- On a novel eccentricity-based invariant of a graph
- On distance-balanced graphs
- On the difference of Mostar index and irregularity of graphs
- Randić index and information
- Relations between total irregularity and non-self-centrality of graphs
- The Szeged and Wiener indices of line graphs
- Trees with the maximal value of Graovac-Pisanski index
Cited in
(11)- Maximally distance-unbalanced trees
- Peripherality in networks: theory and applications
- Minimum distance-unbalancedness of graphs with diameter 2 and given number of edges
- Trinajstić index
- Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones
- On distance-balanced generalized Petersen graphs
- Distance-unbalancedness of graphs
- On 2-distance-balancedness of vertex transitive generalized Petersen graphs
- A new measure for transmission irregularity extent of graphs
- On \(\{1,2\}\)-distance-balancedness of generalized Petersen graphs
- Minimum distance-unbalancedness of trees
This page was built for publication: Distance-unbalancedness of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243233)