期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：2019
卷号：2019
DOI：10.1155/2019/8780329
出版社：Hindawi Publishing Corporation
摘要：A simple graph is said to be an -covering if every edge of belongs to at least one subgraph isomorphic to . A bijection is an (a,d)--antimagic total labeling of if, for all subgraphs isomorphic to , the sum of labels of all vertices and edges in form an arithmetic sequence where , are two fixed integers and is the number of all subgraphs of isomorphic to . The labeling is called super if the smallest possible labels appear on the vertices. A graph that admits (super) --antimagic total labeling is called (super) --antimagic. For a special , the (super) --antimagic total labeling is called -(super)magic labeling. A graph that admits such a labeling is called -(super)magic. The -shadow of graph ,, is a graph obtained by taking copies of , namely, , and then joining every vertex in ,, to the neighbors of the corresponding vertex in . In this paper we studied the -supermagic labelings of where are paths and cycles.
Loading...
