Abstract
AbstractEvery labeling of the vertices of a graph with distinct natural numbers induces a natural labeling of its edges: the label of an edge (x, y) is the absolute value of the difference of the labels of x and y. By analogy with graceful labelings, we say that a labeling of the vertices of a graph of order n is minimally k‐equitable if the vertices are labeled with 1,2,…, n and in the induced labeling of its edges every label either occurs exactly k times or does not occur at all. Bloom [3] posed the following question: Is the condition that k is a proper divisor of n sufficient for the cycle Cn to have a minimal k‐equitable labeling? We give a positive answer to this question. © 1993 John Wiley & Sons, Inc.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.