Nourishing Number of Flower-related Graphs


Abstract views: 76 / PDF downloads: 92

Authors

  • K. I. Vyas Research Scholar, Department of Mathematics, Gujarat University, Ahmedabad, Gujarat, India
  • Udayan Prajapati Department of Mathematics, Gujarat University, Ahmedabad, Gujarat, India

Keywords:

Flower-related graphs, strong integer additive set-indexers, nourishing number of a graph, sumset

Abstract

Let $\mathbb{N}_0 = \mathbb{N} \cup \left\lbrace 0\right\rbrace $ and $\mathcal{P}(\mathbb{N}_0)$ be the power set. If $f : V(G) \to \mathcal{P}(\mathbb{N}_0)$, then its induced map $f^+: E(G) \to \mathcal{P}(\mathbb{N}_0)$ is defined as $f^+(uv) = f(u)+f(v)$ where $f(u)+f(v)$ is the sumset of $f(u)$ and $f(v)$. If $f$ and $f^+$ are injective, and $\left| f^+(uv)\right| = \left| f(u)\right| \left| f(v)\right| $ for all $uv$ in $E(G)$, then $f$ is a strong integer additive set-indexer of $G$. The nourishing number of $G$ is the least order of the maximal complete subgraph of $G$ such that $G$ admits a strong IASI. In this work, we compute the nourishing number of powers of flower-related graphs and graphs formed by duplicating each vertex in flower-related graphs by an edge.

Author Biographies

K. I. Vyas, Research Scholar, Department of Mathematics, Gujarat University, Ahmedabad, Gujarat, India

 

 

Udayan Prajapati, Department of Mathematics, Gujarat University, Ahmedabad, Gujarat, India

 

 

Downloads

Published

13-03-2023

How to Cite

K. I. Vyas, & Prajapati, U. (2023). Nourishing Number of Flower-related Graphs. International Journal of Mathematics And Its Applications, 11(1), 105–112. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/941

Issue

Section

Research Article