Abstract
The euclidean dimension of a graph G, e(G), is the minimum n such that the vertices of G can be placed in euclidean n-space, Rn, in such a way that adjacent vertices have distance 1 and nonadjacent vertices have distances other than 1. Let G=K(n1,...,ns+t+u) be a complete (s+t+u)-partite graph with vertex-classes consisting of s sets of size 1, t sets of size 2, and u sets of size ⩾3. We prove that e(G)=s+t+2u if t+u⩾2, and e(G)=s+t+2u-1 if t+u⩽1.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
