Publication:4094890
From MaRDI portal
zbMath0329.05112MaRDI QIDQ4094890
Roger Entringer, D. E. Jackson, David A. Snyder
Publication date: 1976
Full work available at URL: https://eudml.org/doc/12941
05C35: Extremal problems in graph theory
Related Items
Unnamed Item, Unnamed Item, Average Distance, Independence Number, and Spanning Trees, On the extremal values of the eccentric distance sum of trees, Some new results on distance-based graph invariants, Graph colourings and partitions, The Steiner Wiener index of a graph, Proximity, remoteness and distance eigenvalues of a graph, Orientations of graphs with maximum Wiener index, On a conjecture about Wiener index in iterated line graphs of trees, On the Wiener index of random trees, Proximity and average eccentricity of a graph, Q-Wiener index of some compound trees, Bounds for the Kirchhoff index of bipartite graphs, Concentration of the Kirchhoff index for Erdős-Rényi graphs, Some results on the reciprocal sum-degree distance of graphs, Ordering trees with given matching number by their Wiener indices, Spiders are status unique in trees, The hyper-Wiener index of the generalized hierarchical product of graphs, On the eccentric distance sum of graphs, Graph theory (algorithmic, algebraic, and metric problems), BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet, Another aspect of graph invariants depending on the path metric and an application in nanoscience, Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts, Average distance in weighted graphs, The Wiener maximum quadratic assignment problem, The Wiener index in iterated line graphs, Kirchhoff index of composite graphs, Computation of topological indices of some graphs, The edge-Wiener index of a graph, Four new sums of graphs and their Wiener indices, Distance center and centroid of a median graph, The center and the distance center of a Ptolemaic graph, Annihilators in graphs, Average distance and independence number, On the sum of all distances in composite graphs, Independence and average distance in graphs, On the average Steiner distance of graphs with presribed properties, Average distance and domination number, Extremal values for ratios of distances in trees, Wiener number of vertex-weighted graphs and a chemical application, Wiener number of hexagonal jagged-rectangles, Wiener index versus maximum degree in trees, On Wiener numbers of polygonal nets, On subtrees of trees, Superdominance order and distance of trees with bounded maximum degree, A Wiener-type graph invariant for some bipartite graphs, Wiener index of iterated line graphs of trees homeomorphic to \(H\), The Wiener index of the \(k\)th power of a graph, Relationship between the edge-Wiener index and the Gutman index of a graph, Extremal values on the eccentric distance sum of trees, On the sum of all distances in bipartite graphs, Complete solution of equation \(W(L^3(T))=W(T)\) for the Wiener index of iterated line graphs of trees, Wiener index for graphs and their line graphs with arbitrary large cyclomatic numbers, Variation of the Wiener index under tree transformations, New distance-based graph invariants and relations among them, Statuses and double branch weights of quadrangular outerplanar graphs, A survey of the all-pairs shortest paths problem and its variants in graphs, Resistance distances and the Kirchhoff index in double graphs, Ordering the non-starlike trees with large reverse wiener indices, Unnamed Item, Minimum Average Distance Clique Trees, Statuses and branch-weights of weighted trees, Average distance and vertex-connectivity, Unnamed Item
Cites Work
