arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1311.0345math.CO
收藏

关于某些图结构的稀疏数

On the Sparing Number of Certain Graph Structures

N K Sudev, K A Germina

摘要:

整数加性集合索引器被定义为内射函数$f:V(G)\rightarrow 2^{\mathbb{N}_0}$,使得由$g_f (uv) = f(u)+ f(v)$定义的诱导函数$g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$也是内射的。如果所有$u,v\in V(G)$都满足$|g_f(uv)|=max(|f(u)|,|f(v)|)$,则称IASI $f$为弱IASI。允许弱IASI的图可以称为弱IASI图。图$G$的一个元素,一个顶点或一条边的集索引数是它的集标号的基数。图的单索引元素是$G$中具有集合索引号$1$的元素。图$G$的稀疏数是指图$G$允许弱IASI所需的单指标边的最小数目。本文引入了连通图、包围图和花图的概念,进一步研究了各种有限图运算的稀疏数,并给出了一些有用的结果.

英文摘要:

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. An IASI $f$ is said to be a weak IASI if $|g_f(uv)|=max(|f(u)|,|f(v)|)$ for all $u,v\in V(G)$. A graph which admits a weak IASI may be called a weak IASI graph. The set-indexing number of an element of a graph $G$, a vertex or an edge, is the cardinality of its set-labels. A mono-indexed element of a graph is an element of $G$ which has the set-indexing number $1$. The Sparing number of a graph $G$ is the minimum number of mono-indexed edges required for a graph $G$ to admit a weak IASI. In this paper, we introduce the notion of conjoined graphs, entwined graphs and floral graphs and study further about the sparing number of various finite graph operations as extensions to our earlier studies and provide some useful results on these types of graph structures.

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

↑