Sum index and difference index of graphs

From MaRDI portal
Publication:2104947




Abstract: Let G be a nonempty simple graph with a vertex set V(G) and an edge set E(G). For every injective vertex labeling f:V(G)omathbbZ, there are two induced edge labelings, namely f+:E(G)omathbbZ defined by f+(uv)=f(u)+f(v), and f:E(G)omathbbZ defined by f(uv)=|f(u)f(v)|. The sum index and the difference index are the minimum cardinalities of the ranges of f+ and f, respectively. We provide upper and lower bounds on the sum index and difference index, and determine the sum index and difference index of various families of graphs. We also provide an interesting conjecture relating the sum index and the difference index of graphs.









This page was built for publication: Sum index and difference index of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104947)