On the canonical metric representation, average distance, and partial Hamming graphs

DOI10.1016/j.ejc.2004.07.008zbMath1078.05028OpenAlexW2158678494MaRDI QIDQ2581459

Sandi Klavžar

Publication date: 10 January 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.07.008

zbMATH Keywords

Wiener indexRecognition algorithm

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Cut method and Djoković-Winkler's relation, Szeged-Like Topological Indices and the Efficacy of the Cut Method: The Case of Melem Structures, On the relationship between variable Wiener index and variable Szeged index, Hamming polynomials and their partial derivatives, On the difference between the (revised) Szeged index and the Wiener index of cacti, Partition distance in graphs, Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes, Distance-based topological indices of nanosheets, nanotubes and nanotori of SiO\(_2\), Further Results on Two Families of Nanostructures, Transmission in H-naphtalenic nanosheet, Calculating the edge Wiener and edge Szeged indices of graphs, Embeddability of open-ended carbon nanotubes in hypercubes, Topological indices of the subdivision of a family of partial cubes and computation of \(\mathrm{SiO}_2\) related structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isometric embedding in products of complete graphs
• Isometric embeddings in Hamming graphs
• On scale embeddings of graphs into hypercubes
• On the natural imprint function of a graph
• Clin d'oeil on \(L_1\)-embeddable planar graphs
• Fiber-complemented graphs. I: Structure and invariant subgraphs
• A note on \(l_ 1\)-rigid planar graphs
• On the complexity of recognizing Hamming graphs and related classes of graphs
• Distance-preserving subgraphs of hypercubes
• On Isometric Embeddings of Graphs
• Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
• HYPERMETRIC GRAPHS
• Isometric subgraphs of Hamming graphs and d-convexity
• Geometry of cuts and metrics
• Partial Hamming graphs and expansion procedures