Weak integer additive set-labeled graphs: a creative review

DOI10.1142/S1793557115500527MaRDI QIDQ3452713zbMATH OpenFDO

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

Publication date 13 November 2015

Published in Asian-European Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

integer additive set-indexerinteger additive set-labelingsparing number of a graphweak integer additive set-indexersweakly uniform integer additive set-indexers

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Applications of graph theory (05C90)

Abstract: For a non-empty ground set $X$, finite or infinite, the {em set-valuation} or {em set-labeling} of a given graph $G$ is an injective function $f:V(G)omathcalP(X)$, where $mathcalP(X)$ is the power set of the set $X$. A set-indexer of a graph $G$ is an injective set-valued function $f:V(G)omathcalP(X)$ such that the function $f^{ast}:E(G)omathcalP(X)-emptyset$ defined by $f^{ast}(uv)=f(u)astf(v)$ for every $uvinE(G)$ is also injective., where $ast$ is a binary operation on sets. An integer additive set-indexer (IASI) is defined as an injective function $f:V(G)omathcalP(mathbb{N}_0)$ such that the induced function $g_f:E(G)omathcalP(mathbb{N}_0)$ defined by $g_f(uv)=f(u)+f(v)$ is also injective, where $mathbb{N}_0$ is the set of all non-negative integers and $mathcalP(mathbb{N}_0)$ is its power set. A weak IASI is an IASI $f$ such that $|f^{+}(uv)|=extmax(f(u),f(v))$. In this paper, we critically and creatively review the concepts and properties of weak integer additive set-valued graphs.

Recommendations

• A review on graceful and sequential integer additive set-labeled graphs
• A characterisation of weak integer additive set-indexers of graphs
• A study on integer additive set-valuations of signed graphs
• On weakly uniform integer additive set-indexers of graphs
• Some new results on strong integer additive set-indexers of graphs

Cites work

• A characterisation of weak integer additive set-indexers of graphs
• A note on the sparing number of generalised Petersen graphs
• A Note on the Sparing Number of Graphs
• A note on the sparing number of the sieve graphs of certain graphs
• scientific article; zbMATH DE number 3575605 (Why is no real title available?)
• scientific article; zbMATH DE number 1246635 (Why is no real title available?)
• scientific article; zbMATH DE number 1043733 (Why is no real title available?)
• scientific article; zbMATH DE number 2068142 (Why is no real title available?)
• scientific article; zbMATH DE number 2141600 (Why is no real title available?)
• scientific article; zbMATH DE number 933467 (Why is no real title available?)
• Integer additive set-indexers of a graph: sum square graphs
• On the corona of two graphs
• On weakly uniform integer additive set-indexers of graphs
• Some new results on strong integer additive set-indexers of graphs
• The connectivity of total graphs
• Topological integer additive set-sequential graphs

Cited in

(6)

• The sparing number of certain graph powers
• A characterization for topologically integer additive set-indexer of graphs
• On weakly uniform 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?)
• Topological integer additive set-sequential graphs

This page was built for publication: Weak integer additive set-labeled graphs: a creative review

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