1 research outputs found
Some new results on sum index and difference index
Let be a graph with a vertex set and an edge set . For every injective vertex labeling , there are two induced edge labelings denoted by and . These two edge labelings and are defined by and for each with . The sum index and difference index of are induced by the minimum ranges of and , respectively. In this paper, we obtain the properties of sum and difference index labelings. We also improve the bounds on the sum indices and difference indices of regular graphs and induced subgraphs of graphs. Further, we determine the sum and difference indices of various families of graphs such as the necklace graphs and the complements of matchings, cycles and paths. Finally, we propose some conjectures and questions by comparison