Distance in graphs

From MaRDI portal
Revision as of 07:37, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4094890


DOI10.21136/cmj.1976.101401zbMath0329.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

Wiener index of strong product of graphs, Nordhaus-Gaddum Type results for the Harary index of graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Brouwer type conjecture for the eigenvalues of distance signless Laplacian matrix of a graph, On 2-Connected Transmission Irregular Graphs, Unnamed Item, The second-minimum Wiener index of cacti with given cycles, Wiener Index and Remoteness in Triangulations and Quadrangulations, Unnamed Item, Unnamed Item, MORE ON EDGE HYPER WIENER INDEX OF GRAPHS, MINIMUM DOMINATING SETS WITH MINIMUM STATUS IN GRAPHS, Wiener Index of Families of Unicyclic Graphs Obtained From a Tree, Counting the Numbers of Paths of All Lengths in Symmetric Dendrimers and Its Applications, Proximity in triangulations and quadrangulations, Wiener index of graphs with fixed number of pendant or cut-vertices, Extremal hitting times of trees with some given parameters, Unnamed Item, On a conjecture about the ratio of Wiener index in iterated line graphs, ON WIENER INDEX OF GRAPH COMPLEMENTS, On the transmission-based graph topological indices, Unnamed Item, Average Distance, Independence Number, and Spanning Trees, Unnamed Item, On the extremal values of the eccentric distance sum of trees, Some new results on distance-based graph invariants, Graph colourings and partitions, On maximum Wiener index of directed grids, Unnamed Item, Disproof of a conjecture on the minimum Wiener index of signed trees, Continuous mean distance of a weighted graph, Average distance, minimum degree, and irregularity index, Graphs with small distance-based complexities, Statistical analyses of a class of random pentagonal chain networks with respect to several topological properties, Wiener index of sum of shadowgraphs, The stress of a graph, Vertex-based and edge-based centroids of graphs, On the edge-Szeged index of unicyclic graphs with given diameter, Wreath product of a complete graph with a cyclic graph: topological indices and spectrum, Graphs preserving Wiener index upon vertex removal, Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index, Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs, 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, Wiener indices of maximal \(k\)-degenerate graphs, Comparison between Merrifield-Simmons index and Wiener index of graphs, New composition of graphs and their Wiener indices, Enumeration of the Gutman and Schultz indices in the random polygonal chains, Ordering the non-starlike trees with large reverse wiener indices, Unnamed Item, Minimum Average Distance Clique Trees, Hitting Times, Cover Cost, and the Wiener Index of a Tree, Statuses and branch-weights of weighted trees, Average distance and vertex-connectivity, Unnamed Item, 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, Subtrees of spiro and polyphenyl hexagonal chains, Some remarks on Wiener index of oriented graphs, An inequality between the edge-Wiener index and the Wiener index of a graph, Graph distance measures based on topological indices revisited, Open quipus with the same Wiener index as their quadratic line graph, The Wiener index in iterated line graphs, Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs, On the eccentric subtree number in trees, The maximum Wiener index of maximal planar 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, Infinite family of transmission irregular trees of even order, Further results on the expected hitting time, the cover cost and the related invariants of graphs, On different ``middle parts of a tree, On the difference between the (revised) Szeged index and the Wiener index of cacti, A sharp lower bound on Steiner Wiener index for trees with given diameter, Inverse problem on the Steiner Wiener index, Graphs whose Wiener index does not change when a specific vertex is removed, Partition distance in graphs, Expected distance based on random walks, Some bounds for the Kirchhoff index of graphs, Infinite family of 3-connected cubic transmission irregular graphs, An upper bound on Wiener indices of maximal planar graphs, On the peripheral Wiener index of graphs, On the difference between the Szeged and the Wiener index, Average distance is submultiplicative and subadditive with respect to the strong product of graphs, On subtrees of trees, Proximity, remoteness and girth in graphs, Graphs preserving total distance upon vertex removal, 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\), On \(\sigma\)-span and \(F\)-span of trees and full binary trees, On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs, Infinite family of 2-connected transmission irregular graphs, On a poset of trees revisited, On the difference of Mostar index and irregularity of 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, Cut and pendant vertices and the number of connected induced subgraphs of a graph, \(k\)-Wiener index of a \(k\)-plex, Dumbbell graphs with extremal (reverse) cover cost, On the minimum Kirchhoff index of unicyclic graphs with given girth and diameter, On interval transmission irregular graphs, On the relationship between variable Wiener index and variable Szeged index, Minimum status of series-reduced trees with given parameters, Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs, The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees, On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs, Centers of complex networks, On transmission irregular starlike trees, The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain, On the (reverse) cover cost of trees with some given parameters, On the status sequences of trees, Which numbers are status differences?, On quartic transmission irregular graphs, The Steiner \(k\)-Wiener index of graphs with given minimum degree, Cospectrality of graphs with respect to distance matrices, Some extremal ratios of the distance and subtree problems in binary trees, Pairs of a tree and a nontree graph with the same status sequence, An inequality between variable Wiener index and variable Szeged index, Stepwise transmission irregular graphs, On the extremal graphs with respect to the total reciprocal edge-eccentricity, The structure of graphs with given number of blocks and the maximum Wiener index, Extremal cover cost and reverse cover cost of trees with given segment sequence



Cites Work