On certain arithmetic integer additive set-indexers of graphs

DOI10.1142/S1793830915500251MaRDI QIDQ3451063zbMATH OpenOpenAlexFDO

Authors N. K. Sudev, K. A. Germina

Publication date 10 November 2015

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.6617

zbMATH Keywords

arithmetic integer additive set-indexersbiarithmetic integer additive set-indexersinteger additive set-indexersisoarithmetic integer additive set-indexersuniform integer additive set-indexers

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: Let $mathbb{N}_0$ denote the set of all non-negative integers and $mathcalP(mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) of a graph $G$ is an injective function $f:V(G)omathcalP(mathbb{N}_0)$ such that the induced function $f^{+}:E(G)omathcalP(mathbb{N}_0)$ defined by $f^{+}(uv)=f(u)+f(v)$ is also injective, where $mathbb{N}_0$ is the set of all non-negative integers. A graph $G$ which admits an IASI is called an IASI graph. An IASI of a graph $G$ is said to be an arithmetic IASI if the elements of the set-labels of all vertices and edges of $G$ are in arithmetic progressions. In this paper, we discuss about two special types of arithmetic IASIs.

Recommendations

• A study on prime arithmetic integer additive set-indexers of graphs
• Some new results on strong integer additive set-indexers of graphs
• A study on integer additive set-valuations of signed graphs
• Integer additive set-indexers of a graph: sum square graphs
• A characterisation of weak integer additive set-indexers of graphs

Cites work

• Arithmetic graphs
• scientific article; zbMATH DE number 1270594 (Why is no real title available?)
• scientific article; zbMATH DE number 2141600 (Why is no real title available?)
• On weakly uniform integer additive set-indexers of graphs

Cited in

(16)

• The sparing number of certain graph powers
• A study on the nourishing number of graphs and graph powers
• A characterization for topologically integer additive set-indexer of graphs
• On set-indexers of graphs
• A characterisation of weak integer additive set-indexers of graphs
• ON SET-INDEXERS OF PATHS, CYCLES AND CERTAIN RELATED GRAPHS
• Integer additive set-indexers of a graph: sum square graphs
• A study on integer additive set-valuations of signed graphs
• A study on prime arithmetic integer additive set-indexers of graphs
• A review on graceful and sequential integer additive set-labeled graphs
• scientific article; zbMATH DE number 7268059 (Why is no real title available?)
• A study on the product set-labeling of graphs
• Some new results on strong integer additive set-indexers of graphs
• Switched signed graphs of integer additive set-valued signed graphs
• Nourishing number of some associated graphs
• Topological integer additive set-sequential graphs

This page was built for publication: On certain arithmetic integer additive set-indexers of graphs

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