Cut method and Djoković-Winkler's relation
From MaRDI portal
Publication:277477
DOI10.1016/J.ENDM.2013.11.029zbMATH Open1338.05068OpenAlexW1985770426MaRDI QIDQ277477FDOQ277477
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
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
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)
Cites Work
- Isometric embedding in products of complete graphs
- Distance-preserving subgraphs of hypercubes
- On the canonical metric representation, average distance, and partial Hamming graphs
- A bird's eye view of the cut method and a survey of its applications in chemical graph theory
- On Isometric Embeddings of Graphs
- Calculating the edge Wiener and edge Szeged indices of graphs
- Some new results on distance-based graph invariants
Cited In (2)
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)