Abstract
The subdivision number of a graph G is defined to be the minimum number of extra vertices inserted into the edges of G to make it isomorphic to a unit-distance graph in the plane. Lett (n) denote the maximum number of edges of a C4-free graph on n vertices. It is proved that the subdivision number of Knlies betweenn (n− 1)/2 −t(n) and (n− 2)(n− 3)/2 + 2, and that of K(m, n) equals (m− 1)(n−m) forn≥m(m− 1).
Sign-in/Register to access full text options 
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.
