The following pages link to (Q5606538):
Displaying 50 items.
- Proximity, remoteness and distance eigenvalues of a graph (Q313783) (← links)
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks (Q391236) (← links)
- Proximity and average eccentricity of a graph (Q436337) (← links)
- Spiders are status unique in trees (Q534035) (← links)
- An axiomatization of the median procedure on the \(n\)-cube (Q540156) (← links)
- The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
- Medians and centres of polyominoes (Q672091) (← links)
- Lattice valuations, medians and majorities (Q686486) (← links)
- The \(p\)-maxian problem on block graphs (Q711397) (← links)
- The distances between internal vertices and leaves of a tree (Q740265) (← links)
- Medians in median graphs (Q791544) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- The extremal values of the Wiener index of a tree with given degree sequence (Q948686) (← links)
- A polynomial method for the pos/neg weighted 3-median problem on a tree (Q1006548) (← links)
- Average distances and distance domination numbers (Q1028442) (← links)
- Accretion centers: A generalization of branch weight centroids (Q1155631) (← links)
- Another characterization of the centroid of a tree (Q1255498) (← links)
- Two-cacti with minimum number of spanning trees (Q1313842) (← links)
- On the average Steiner distance of graphs with presribed properties (Q1372733) (← links)
- Average distance and domination number (Q1377614) (← links)
- Extremal values for ratios of distances in trees (Q1377615) (← links)
- The majority strategy on graphs (Q1377621) (← links)
- A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem (Q1380926) (← links)
- Steiner intervals in graphs (Q1382264) (← links)
- The \(k\)-ball \(l\)-path branch weight centroid (Q1382282) (← links)
- Median problem in some plane triangulations and quadrangulations. (Q1428459) (← links)
- Wiener index versus maximum degree in trees (Q1613418) (← links)
- Peripheral Wiener index of trees and related questions (Q1627854) (← links)
- Maximizing distance between center, centroid and subtree core of trees (Q1713074) (← links)
- On subtrees of trees (Q1775731) (← links)
- Proximity, remoteness and girth in graphs (Q1786868) (← links)
- A note on balance vertices in trees (Q1827688) (← links)
- Directed virtual path layouts in ATM networks (Q1870524) (← links)
- Minimum statuses of connected graphs with fixed maximum degree and order (Q1928529) (← links)
- Finding a core of a tree with pos/neg weight (Q1935945) (← links)
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees (Q1999724) (← links)
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost (Q2032849) (← links)
- Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree (Q2037591) (← links)
- On the maximum mean subtree order of trees (Q2048363) (← links)
- A conjecture on different central parts of binary trees (Q2102762) (← links)
- On the relationship between variable Wiener index and variable Szeged index (Q2152719) (← links)
- Minimum status of series-reduced trees with given parameters (Q2160321) (← links)
- On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs (Q2172411) (← links)
- Centers of complex networks (Q2177250) (← links)
- On the (reverse) cover cost of trees with some given parameters (Q2214070) (← links)
- Proximity and remoteness in directed and undirected graphs (Q2222950) (← links)
- Which numbers are status differences? (Q2242632) (← links)
- A centrality notion for graphs based on Tukey depth (Q2244178) (← links)
- Some extremal ratios of the distance and subtree problems in binary trees (Q2279596) (← links)
- On distances in vertex-weighted trees (Q2335160) (← links)
