Cut method and Djoković-Winkler's relation

DOI10.1016/J.ENDM.2013.11.029MaRDI QIDQ277477zbMATH OpenOpenAlexFDO

Authors Sandi Klavžar, Mohammad Javad Nadjafi-Arani

Publication date 29 April 2016

Full work available at URL https://doi.org/10.1016/j.endm.2013.11.029

zbMATH Keywords

isometric embeddingweighted graphWiener indexpartial cubeDjoković-Winkler relation

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex degrees (05C07) Distance in graphs (05C12) Signed and weighted graphs (05C22)

Recommendations

• Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
• Computing distance moments on graphs with transitive Djoković-Winkler relation
• Generalized cut method for computing the edge-Wiener index
• A theorem on Wiener-type invariants for isometric subgraphs of hypercubes
• On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs

Cites work

• A bird's eye view of the cut method and a survey of its applications in chemical graph theory
• Calculating the edge Wiener and edge Szeged indices of graphs
• Distance-preserving subgraphs of hypercubes
• Isometric embedding in products of complete graphs
• On Isometric Embeddings of Graphs
• On the canonical metric representation, average distance, and partial Hamming graphs
• Some new results on distance-based graph invariants

Cited in

(4)

• Computing distance moments on graphs with transitive Djoković-Winkler relation
• The complement of the Djoković-Winkler relation
• On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs
• A theorem on Wiener-type invariants for isometric subgraphs of hypercubes

This page was built for publication: Cut method and Djoković-Winkler's relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277477)