The sparing number of certain graph powers

DOI10.2478/ausm-2019-0015zbMath1434.05127arXiv1405.4787OpenAlexW2969780405WikidataQ127371567 ScholiaQ127371567MaRDI QIDQ2305137

Sudev Naduvath, K. A. Germina, Kaithavalappil P. Chithra

Publication date: 10 March 2020

Published in: Acta Universitatis Sapientiae. Mathematica (Search for Journal in Brave)

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

zbMATH Keywords

graph powersinteger additive set-indexersmono-indexed elements of a graphsparing number of a graphweak integer additive set-indexers

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic survey of graph labeling
• Methods of destroying the symmetries of a graph
• A study on the nourishing number of graphs and graph powers
• A Note on the Sparing Number of the Sieve Graphs of Certain Graphs
• A Characterisation of weak integer additive Set-Indexers of graphs
• On weakly uniform integer additive set-indexers of graphs
• Weak integer additive set-labeled graphs: A creative review
• Graph Classes: A Survey
• Some new results on strong integer additive set-indexers of graphs

This page was built for publication: The sparing number of certain graph powers