Abstract
We consider the minimum number of cliques needed to partition the edge set of D ( G ) , the distance multigraph of a simple graph G. Equivalently, we seek to minimize the number of elements needed to label the vertices of a simple graph G by sets so that the distance between two vertices equals the cardinality of the intersection of their labels. We use a fractional analogue of this parameter to find lower bounds for the distance multigraphs of various classes of graphs. Some of the bounds are shown to be exact.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have