A study on the nourishing number of graphs and graph powers

DOI10.3390/math3010029zbMath1309.05105arXiv1405.4788OpenAlexW2066767025MaRDI QIDQ2339585

Sudev Naduvath, K. A. Germina

Publication date: 2 April 2015

Published in: Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph powersinteger additive set-indexersnourishing number of a graphstrong integer additive set-indexers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

On the semigroup whose elements are subgraphs of a complete graph ⋮ The sparing number of certain graph powers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Characterisation of weak integer additive Set-Indexers of graphs
• On certain arithmetic integer additive set-indexers of graphs
• Some new results on strong integer additive set-indexers of graphs

This page was built for publication: A study on the nourishing number of graphs and graph powers