arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.7672math.CO
收藏

关于图的可加集指标

On Integer Additive Set-Indexers of Graphs

N. K. Sudev, K. A. Germina

摘要:

图$G$的集指标是一个内射集值函数$f:V(G) \rightarrow2^{X}$,使得由$f^{\oplus}(uv) = f(u){\oplus} f(v)$对每个$uv{\in} E(G)$定义的函数$f^{\oplus}:E(G)\rightarrow2^{X}-\{\emptyset\}$也是内射的,其中$2^{X}$是$X$的所有子集的集合,$\oplus$是集合的对称差。整数加性集合索引器被定义为内射函数$f:V(G)\rightarrow 2^{\mathbb{N}_0}$,使得由$g_f (uv) = f(u)+ f(v)$定义的诱导函数$g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$也是内射的。允许IASI的图$G$称为IASI图。如果$|g_f(uv)|=max(|f(u)|,|f(v)|)$,则IASI $f$被称为{ \em weak IASI},如果$|g_f(uv)|=|f(u)| |f(v)|$对于所有$u,v\in V(G)$,则IASI $f$被称为{ \em strong IASI}。本文研究了互加集索引的若干性质。

英文摘要:

A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \rightarrow2^{X}$ such that the function $f^{\oplus}:E(G)\rightarrow2^{X}-\{\emptyset\}$ defined by $f^{\oplus}(uv) = f(u){\oplus} f(v)$ for every $uv{\in} E(G)$ is also injective, where $2^{X}$ is the set of all subsets of $X$ and $\oplus$ is the symmetric difference of sets. An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective. A graph $G$ which admits an IASI is called an IASI graph. An IASI $f$ is said to be a {\em weak IASI} if $|g_f(uv)|=max(|f(u)|,|f(v)|)$ and an IASI $f$ is said to be a {\em strong IASI} if $|g_f(uv)|=|f(u)| |f(v)|$ for all $u,v\in V(G)$. In this paper, we study about certain characteristics of inter additive set-indexers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑