scientific article; zbMATH DE number 194437

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Distance paths graph theory median Diameter Radius Centers

Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph theory (05Cxx)

Related Items (only showing first 100 items - show all)

Characterization of eccentric digraphs ⋮ The Steiner Wiener index of a graph ⋮ The bipartite edge frustration of hierarchical product of graphs ⋮ Eccentric connectivity index of graphs with subdivided edges ⋮ On Wiener and multiplicative Wiener indices of graphs ⋮ About triangles in a graph and its complement ⋮ On the number of spanning trees of multi-star related graphs ⋮ Terminal Wiener index ⋮ On the sum of all distances in composite graphs ⋮ Eccentricity-based topological indices of a cyclic octahedron structure ⋮ The vertex version of weighted Wiener number for bicyclic molecular structures ⋮ Optimal allocation for partially replicated database systems on tree- based networks ⋮ Reconstruction of distance hereditary 2-connected graphs ⋮ Proximity, remoteness and distance eigenvalues of a graph ⋮ Combinatorial properties of generalized hypercube graphs ⋮ A new geometric-arithmetic index ⋮ The distance spectrum of corona and cluster of two graphs ⋮ The forcing vertex detour monophonic number of a graph ⋮ The center of an infinite graph ⋮ The number of kings in a multipartite tournament ⋮ Eccentric digraphs of trees ⋮ Radio secure number of a graph ⋮ Upper detour monophonic number of a graph ⋮ Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two ⋮ A bypassing path based routing algorithm for the pyramid structures ⋮ Similarity and dissimilarity in posets ⋮ On average eccentricity of graphs ⋮ The maximum girth and minimum circumference of graphs with prescribed radius and diameter ⋮ Null inclusion dependencies in relational databases ⋮ On the extremal properties of the average eccentricity ⋮ Monophonic numbers of the join and composition of connected graphs ⋮ Graph operations and neighbor rupture degree ⋮ Iterated joining of rooted trees ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ Constructing status injective graphs ⋮ Coalescent random walks on graphs ⋮ Computing the shortest essential cycle ⋮ Landscapes and their correlation functions ⋮ Random walks on edge transitive graphs ⋮ Status connectivity indices of graphs and its applications to the boiling point of benzenoid hydrocarbons ⋮ A generalized broadcasting schema for the mesh structures ⋮ Distance in digraphs ⋮ Transitional values of graphs ⋮ The hidden algorithm of Ore's theorem on Hamiltonian cycles ⋮ Hyperspherical embedding of graphs and networks in communicability spaces ⋮ Inverse problem on the Steiner Wiener index ⋮ Relation between Wiener numbers of quasi-hexagonal chains and quasi-polyomino chains ⋮ The communicability distance in graphs ⋮ Comparison between Kirchhoff index and the Laplacian-energy-like invariant ⋮ A class of graph-geodetic distances generalizing the shortest-path and the resistance distances ⋮ Total and forcing total edge-to-vertex monophonic number of a graph ⋮ The eccentric weight of graphs ⋮ The walk distances in graphs ⋮ Edge-grafting transformations on the average eccentricity of graphs and their applications ⋮ Proximity and average eccentricity of a graph ⋮ Radius-edge-invariant and diameter-edge-invariant graphs ⋮ The calculation of average distance in mesh structures. ⋮ On the sizes of graphs and their powers: the undirected case ⋮ Distance-sum heterogeneity in graphs and complex networks ⋮ New inequalities between information measures of network information content ⋮ Modelling the navigation potential of a web page ⋮ Divider-based algorithms for hierarchical tree partitioning. ⋮ The obnoxious center problem on weighted cactus graphs. ⋮ Geodetic spectra of graphs. ⋮ The Wiener polynomial of the \(k\)th power graph ⋮ A lower bound for the convexity number of some graphs ⋮ Characterization of super-radial graphs ⋮ Diameter-vital edges in a graph ⋮ Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes ⋮ The convexity spectra of graphs ⋮ Information processing in complex networks: Graph entropy and information functionals ⋮ A cut locus for finite graphs and the farthest point mapping ⋮ Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs ⋮ From ternary strings to Wiener indices of benzenoid chains ⋮ Expected cover times of random walks on symmetric graphs ⋮ Sharp bounds on the distance spectral radius and the distance energy of graphs ⋮ Inequalities for entropy-based measures of network information content ⋮ The distance spectra of Cayley graphs of Coxeter groups ⋮ Spiders are status unique in trees ⋮ On the distance distribution of trees ⋮ Centrality measure in graphs ⋮ On reliability indices of communication networks ⋮ Distance spectra and distance energy of integral circulant graphs ⋮ On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs ⋮ On relation between Kirchhoff index, Laplacian-energy-like invariant and Laplacian energy of graphs ⋮ A matrix-based approach to searching colored paths in a weighted colored multidigraph ⋮ Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model ⋮ The upper connected geodetic number and forcing connected geodetic number of a graph ⋮ Four new sums of graphs and their Wiener indices ⋮ A review of extensive facility location in networks ⋮ Hamiltonian connectivity of the WK-recursive network with faulty nodes ⋮ Centers of sets of pixels ⋮ Random walks on edge-transitive graphs. II ⋮ Some personal views on the current state and the future of locational analysis ⋮ Geodesic visibility in graphs ⋮ Geodetic metrizations of graphs ⋮ A self-stabilizing algorithm which finds a 2-center of a tree ⋮ A clustering algorithm based on graph connectivity ⋮ A method for repairing the inconsistency of fuzzy preference relations ⋮ Subdivision thresholds for two classes of graphs

This page was built for publication: