Partition distance in graphs
From MaRDI portal
Publication:1703394
DOI10.1007/s10910-017-0781-5zbMath1382.05021OpenAlexW2736932711MaRDI QIDQ1703394
Sandi Klavžar, Mohammad Javad Nadjafi-Arani
Publication date: 2 March 2018
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-017-0781-5
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex cut method for degree and distance-based topological indices and its applications to silicate networks
- Generalizations of Wiener polarity index and terminal Wiener index
- Isometric embedding in products of complete graphs
- Terminal Wiener index
- Wiener number of vertex-weighted graphs and a chemical application
- Moore-Penrose inverse of a Euclidean distance matrix
- Equal opportunity networks, distance-balanced graphs, and Wiener game
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
- Median problems on wheels and cactus graphs
- Distance-preserving subgraphs of hypercubes
- On the canonical metric representation, average distance, and partial Hamming graphs
- Average distance in colored graphs
- The Terminal Wiener Index of Trees with Diameter or Maximum Degree
- Modified Wiener index via canonical metric representation, and some fullerene patches
- On Isometric Embeddings of Graphs
- Minimean Location of Different Facilities on a Line Network
- Distance in graphs
- Average Distance, Independence Number, and Spanning Trees
This page was built for publication: Partition distance in graphs
