Cut method and Djoković-Winkler's relation
From MaRDI portal
Publication:277477
DOI10.1016/j.endm.2013.11.029zbMath1338.05068OpenAlexW1985770426MaRDI QIDQ277477
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
Distance in graphs (05C12) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Calculating the edge Wiener and edge Szeged indices of graphs
- Isometric embedding in products of complete graphs
- Distance-preserving subgraphs of hypercubes
- On the canonical metric representation, average distance, and partial Hamming graphs
- On Isometric Embeddings of Graphs
- Some new results on distance-based graph invariants
This page was built for publication: Cut method and Djoković-Winkler's relation