Sum index and difference index of graphs
From MaRDI portal
Publication:2104947
Abstract: Let be a nonempty simple graph with a vertex set and an edge set . For every injective vertex labeling , there are two induced edge labelings, namely defined by , and defined by . The sum index and the difference index are the minimum cardinalities of the ranges of and , 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4130422 (Why is no real title available?)
- scientific article; zbMATH DE number 5054103 (Why is no real title available?)
- Characterisation of graphs with exclusive sum labeling
- Combinatorial Geometry and Graph Theory
- On super totient numbers and super totient labelings of graphs
- Pair sum labeling of graphs
Cited in
(2)
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)