Wiener number of vertex-weighted graphs and a chemical application
From MaRDI portal
Publication:1377617
DOI10.1016/S0166-218X(97)00070-XzbMath0889.05046OpenAlexW2104803612MaRDI QIDQ1377617
Publication date: 11 June 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Applications of graph theory (05C90) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
Wiener index in graphs with given minimum degree and maximum degree, On the extreme eccentric distance sum of graphs with some given parameters, Analytical expressions for Wiener indices of \(n\)-circumscribed peri-condensed benzenoid graphs, A theorem on Wiener-type invariants for isometric subgraphs of hypercubes, A survey of the all-pairs shortest paths problem and its variants in graphs, The vertex version of weighted Wiener number for bicyclic molecular structures, Generalizations of Wiener polarity index and terminal Wiener index, Wiener Index on Lines of Unit Cells of the Body-Centered Cubic Grid, Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs, Some properties for a class of interchange graphs, Isometric embeddings of subdivided wheels in hypercubes, Computing quadratic entropy in evolutionary trees, On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs, Partition distance in graphs, Wiener index versus Szeged index in networks, Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes, Distance-based topological indices of nanosheets, nanotubes and nanotori of SiO\(_2\), A linear algorithm for the Hamiltonian completion number of the line graph of a cactus., The edge-Wiener index and the edge-hyper-Wiener index of phenylenes, The Hosoya polynomial of double weighted graphs, Computing the Schultz polynomials and indices for ladder related graphs, Generalized Hosoya polynomials of hexagonal chains, The Szeged index and the Wiener index of partial cubes with applications to chemical graphs, Distance distributions for graphs modeling computer networks, Maximizing Wiener index for trees with given vertex weight and degree sequences, The Hosoya polynomial decomposition for hexagonal chains, The \(\rho\)-moments of vertex-weighted graphs, Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data, Wiener index of graphs with more than one cut-vertex, The Hosoya polynomial decomposition for catacondensed benzenoid graphs, Unnamed Item, Unnamed Item, ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS, On distances in vertex-weighted trees, Some results about the inset edge and average distance of trees, On the minimum eccentric distance sum of bipartite graphs with some given parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isometric embedding in products of complete graphs
- Isometric embeddings in Hamming graphs
- When each hexagon of a hexagonal system covers it
- Mean distance in a graph
- Average distances in undirected graphs and the removal of vertices
- Laplacian matrices of graphs: A survey
- Average distance and independence number
- On the sum of all distances in composite graphs
- Mean distance in a tree
- On the complexity of recognizing Hamming graphs and related classes of graphs
- Distance-preserving subgraphs of hypercubes
- An edge version of the matrix-tree theorem and the wiener index
- On the sum of all distances in a graph or digraph
- On Isometric Embeddings of Graphs
- Distance in graphs
- Isometric subgraphs of Hamming graphs and d-convexity
- Recognizing binary Hamming graphs inO(n 2 logn) time
- Perfect matchings in hexagonal systems
- Perfect matchings in hexagonal systems
