Integer additive set-indexers of a graph: sum square graphs
From MaRDI portal
Publication:3189124
zbMATH Open1301.05293MaRDI QIDQ3189124FDOQ3189124
Authors: K. A. Germina, T. M. K. Anandavally
Publication date: 9 September 2014
Recommendations
- Some new results on strong integer additive set-indexers of graphs
- On certain arithmetic integer additive set-indexers of graphs
- A characterisation of weak integer additive set-indexers of graphs
- A study on prime arithmetic integer additive set-indexers of graphs
- A study on integer additive set-valuations of signed graphs
Cited In (15)
- A characterization for topologically integer additive set-indexer of graphs
- Nourishing number of some associated graphs
- A study on prime arithmetic integer additive set-indexers of graphs
- A review on graceful and sequential integer additive set-labeled graphs
- On weakly uniform integer additive set-indexers of graphs
- On certain arithmetic integer additive set-indexers of graphs
- The sparing number of certain graph powers
- Topological integer additive set-sequential graphs
- A characterisation of weak integer additive set-indexers of graphs
- Weak integer additive set-labeled graphs: a creative review
- On Weak Integer Additive Set-Indexers of Certain Graph Classes
- A study on topological integer additive set-labeling of graphs
- A study on the modular sumset labeling of graphs
- A study on the nourishing number of graphs and graph powers
- Some new results on strong integer additive set-indexers of graphs
This page was built for publication: Integer additive set-indexers of a graph: sum square graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189124)