关于图的边电晕的稀疏数
On the Sparing Number of the Edge-Corona of Graphs
摘要:
设$\mathbb{N}_0$是所有非负整数的集合,$\mathcal{P}(\mathbb{N}_0)$是它的幂集.图$G$的整数加性集索引器(IASI)是一个内射函数$f:V(G)\to \mathcal{P}(\mathbb{N}_0)$,使得由$f^+ (uv) = f(u)+ f(v)$定义的导出函数$f^+:E(G) \to \mathcal{P}(\mathbb{N}_0)$也是内射的,其中$f(u)+f(v)$是$f(u)$和$f(v)$的和集.一个整数加性集合索引器$f$称为弱整数加性集合索引器(弱IASI),如果$|f^+(uv)|=\max(|f(u)|,|f(v)|)~\forall ~ uv\in E(G)$。图$G$允许IASI所需的单集标记边的最小数目称为图的稀疏数。本文利用两个图的边冠讨论了弱IASI的可容许性,并确定了某些图的边冠的保留数。
英文摘要:
Let $\mathbb{N}_0$ be the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its the power set. An integer additive set-indexer (IASI) of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that the induced function $f^+:E(G) \to \mathcal{P}(\mathbb{N}_0)$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective, where $f(u)+f(v)$ is the sum set of $f(u)$ and $f(v)$. An integer additive set-indexer $f$ is said to be a weak integer additive set-indexer (weak IASI) if $|f^+(uv)|=\max(|f(u)|,|f(v)|)~\forall ~ uv\in E(G)$. The minimum number of singleton set-labeled edges required for the graph $G$ to admit an IASI is called the sparing number of the graph. In this paper, we discuss the admissibility of weak IASI by a particular type of graph product called the edge corona of two given graphs and determine the sparing number of the edge corona of certain graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。