Ultrametrics and Complete Multipartite Graphs
From MaRDI portal
Recommendations
- The complexity of ultrametric partitions on graphs
- Ulam numbers of graphs
- A class of uniformly optimality complete multi-partite graphs
- Ultrametrization of weighted graphs
- On the Euclidean dimension of a complete multipartite graph
- Complete multipartite graphs and Braess edges
- scientific article; zbMATH DE number 5844285
- Complete multipartite graphs and their null set
- On graphs with complete multipartite \(\mu \)-graphs
- On metric dimension of graphs and their complements
Cited in
(15)- The complexity of ultrametric partitions on graphs
- Quasi-ultrametrics and their \(2\)-ball hypergraphs
- Diameter and diametrical pairs of points in ultrametric spaces
- Uniqueness of best proximity pairs and rigidity of semimetric spaces
- Bipartite graphs and best proximity pairs
- The Ultimate Categorical Independence Ratio of Complete Multipartite Graphs
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
- Prescribed ultrametrics
- Proximinal sets and connectedness in graphs
- Locally Finite ultrametric spaces and labeled trees
- Ultrametrics and complete multipartite graphs
- Strongly ultrametric preserving functions
- Forbidden four cycle, star graphs and isometric embeddings
- Hausdorff distance between ultrametric balls
- Totally bounded ultrametric spaces generated by labeled rays
This page was built for publication: Ultrametrics and Complete Multipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057210)
