scientific article; zbMATH DE number 3328106
From MaRDI portal
Publication:5606538
zbMath0206.26105MaRDI QIDQ5606538
Publication date: 1968
Full work available at URL: https://eudml.org/doc/15833
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (77)
Wiener index versus maximum degree in trees ⋮ Unnamed Item ⋮ Different central parts of trees and their pairwise distances ⋮ MINIMUM DOMINATING SETS WITH MINIMUM STATUS IN GRAPHS ⋮ Unnamed Item ⋮ Peripheral Wiener index of trees and related questions ⋮ Proximity in triangulations and quadrangulations ⋮ Proximity, remoteness and distance eigenvalues of a graph ⋮ On the relationship between variable Wiener index and variable Szeged index ⋮ Distance in graphs ⋮ Minimum status of series-reduced trees with given parameters ⋮ On the average Steiner distance of graphs with presribed properties ⋮ Partitionability of trees ⋮ On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs ⋮ Average distance and domination number ⋮ Extremal values for ratios of distances in trees ⋮ The majority strategy on graphs ⋮ Approximating call-scheduling makespan in all-optical networks ⋮ A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem ⋮ Steiner intervals in graphs ⋮ The \(k\)-ball \(l\)-path branch weight centroid ⋮ Centers of complex networks ⋮ A Survey on Approximation Mechanism Design Without Money for Facility Games ⋮ The \(p\)-Maxian problem on interval graphs ⋮ Minimum statuses of connected graphs with fixed maximum degree and order ⋮ Strategy-proof approximation mechanisms for an obnoxious facility game on networks ⋮ Proximity, remoteness and maximum degree in graphs ⋮ Finding a core of a tree with pos/neg weight ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Minimum status of trees with a given degree sequence ⋮ On the Number of Nonisomorphic Subtrees of a Tree ⋮ Accretion centers: A generalization of branch weight centroids ⋮ Proximity and average eccentricity of a graph ⋮ Extremal values of ratios: distance problems vs. subtree problems in trees. II ⋮ Maximizing distance between center, centroid and subtree core of trees ⋮ Block-vertex duality and the one-median problem ⋮ A modified optimal algorithm for 2-maxian location problems on cactus graphs ⋮ A self-stabilizing algorithm for finding weighted centroid in trees ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ Median problem in some plane triangulations and quadrangulations. ⋮ Proximity and remoteness in directed and undirected graphs ⋮ Computing the 2‐median on tree networks in O(n lg n) time ⋮ Medians and centres of polyominoes ⋮ The \(p\)-maxian problem on a tree ⋮ The extremal values of the Wiener index of a tree with given degree sequence ⋮ Which numbers are status differences? ⋮ A centrality notion for graphs based on Tukey depth ⋮ Lattice valuations, medians and majorities ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ Spiders are status unique in trees ⋮ An axiomatization of the median procedure on the \(n\)-cube ⋮ The \(p\)-maxian problem on block graphs ⋮ On subtrees of trees ⋮ Centers to centroids in graphs ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ Proximity, remoteness and girth in graphs ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree ⋮ Statuses and branch-weights of weighted trees ⋮ Statuses and double branch weights of quadrangular outerplanar graphs ⋮ A polynomial method for the pos/neg weighted 3-median problem on a tree ⋮ Another characterization of the centroid of a tree ⋮ The distances between internal vertices and leaves of a tree ⋮ On the maximum mean subtree order of trees ⋮ Average distances and distance domination numbers ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations ⋮ A note on balance vertices in trees ⋮ On distances in vertex-weighted trees ⋮ Medians in median graphs ⋮ The 2-maxian problem on cactus graphs ⋮ Balance in trees ⋮ Proximity, remoteness and minimum degree ⋮ A conjecture on different central parts of binary trees ⋮ Degree distance based topological indices of some graph transforms ⋮ Two-cacti with minimum number of spanning trees ⋮ Directed virtual path layouts in ATM networks
This page was built for publication:
