Super edge-magic strength of fire crackers, banana trees and unicyclic graphs

详细信息    查看全文

• 作者：V. Swaminathan and P. Jeyanthi
• 关键词：Super edge-magic labeling ; Super edge-magic strength
• 刊名：Discrete Mathematics
• 出版年：2006
• 出版时间：28 July 2006
• 年：2006
• 卷：306
• 期：14
• 页码：1624-1636
• 全文大小：271 K

文摘

A graph G(V,E) is called super edge-magic if there exists a bijection f from VE to f2cd32d6c0"" title=""Click to view the MathML source"">{1,2,3,…,|V|+|E|} such that fff3c6dfff2d4de0964aa"" title=""Click to view the MathML source"">f(u)+f(v)+f(uv)=c(f) is constant for any uvE and f(V)={1,2,3,…,|V|}. Such a bijection is called a super edge-magic labeling of G. The super edge-magic strength of a graph G is defined as the minimum of all c(f) where the minimum runs over all super edge-magic labelings of G and is denoted by sm(G). The super edge-magic strength of some families of graphs are obtained in this paper.