Graph labeling is the assignment of integers to the vertices,edges,or both,subject to certain conditions.Accordingly,hypergraph labeling is also the assignment of integers to the vertices,edges,or both,subject to cert...Graph labeling is the assignment of integers to the vertices,edges,or both,subject to certain conditions.Accordingly,hypergraph labeling is also the assignment of integers to the vertices,edges,or both,subject to certain conditions.This paper is to generalize the coprime labelings of graph to hypergraph.We give the definition of coprime labelings of hypergraph.By using Rosser-Schoenfeld's inequality and the coprime mapping theorem of Pomerance and Selfridge,we prove that some linear hypergraphs are prime.展开更多
基金Supported by the Natural Science Foundation of Chongqing(CSTB2022NSCQ-MSX0884)。
文摘Graph labeling is the assignment of integers to the vertices,edges,or both,subject to certain conditions.Accordingly,hypergraph labeling is also the assignment of integers to the vertices,edges,or both,subject to certain conditions.This paper is to generalize the coprime labelings of graph to hypergraph.We give the definition of coprime labelings of hypergraph.By using Rosser-Schoenfeld's inequality and the coprime mapping theorem of Pomerance and Selfridge,we prove that some linear hypergraphs are prime.
