Abstract

Let G=(V,E) be a finite graph, where |V|=p≥2 and |E|=q≥1. A vertex-magic total labeling is a bijection f from V∪E to {1,2,…,p+q} with the property that for every u∈V, f(u)+∑v∈N(u)f(uv)=k for some constant k. Such a labeling is E-super if f(E)={1,2,…,q}. In this paper, we prove that semi-regular bipartite graphs are not E-super vertex-magic. Also we obtain an upper bound for the maximum degree Δ(G) of an E-super vertex-magic graph and we investigate upper and lower bounds of any vertex degree d of E-super vertex-magic graph.

Full Text
Paper version not known

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 call

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.