一类IASL-图的弱集标号数
Weak Set-Labeling Number of Certain IASL-Graphs
摘要:
设$\mathbb{N}_0$是所有非负整数的集合,设$X\subset \mathbb{N}_0$和$\mathcal{P}(X)$是$X$的幂集.图$G$的整数可加集标号(IASL)是一个内射函数$f:V(G)\to \mathcal{P}(\mathbb{N}_0)$,使得导出函数$f^+:E(G) \to \mathcal{P}(\mathbb{N}_0)$由$f^+ (uv) = f(u)+ f(v)$定义,其中$f(u)+f(v)$是$f(u)$与$f(v)$的和集.如果图$G$的导出边函数$f^+$也是单射的,则称IASL $f$是图$G$的整数加性集索引器(IASI).一个整数可加集合标号$f$称为弱整数可加集合标号(WIASL),如果$|f^+(uv)|=\max(|f(u)|,|f(v)|)~\forall ~ uv\in E(G)$ .一个给定的图$G$允许一个IASL所需的基集$X$的最小基数称为图的集标号数。本文引入了图$G$的弱集标号数的概念,作为$X$的最小基数,使得$G$关于基集$X$有一个WIASL,并讨论了某些图的弱集标号数.
英文摘要:
Let $\mathbb{N}_0$ be the set of all non-negative integers, let $X\subset \mathbb{N}_0$ and $\mathcal{P}(X)$ be the the power set of $X$. An integer additive set-labeling (IASL) 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)$ is defined by $f^+ (uv) = f(u)+ f(v)$, where $f(u)+f(v)$ is the sum set of $f(u)$ and $f(v)$. An IASL $f$ is said to be an integer additive set-indexer (IASI) of a graph $G$ if the induced edge function $f^+$ is also injective. An integer additive set-labeling $f$ is said to be a weak integer additive set-labeling (WIASL) if $|f^+(uv)|=\max(|f(u)|,|f(v)|)~\forall ~ uv\in E(G)$. The minimum cardinality of the ground set $X$ required for a given graph $G$ to admit an IASL is called the set-labeling number of the graph. In this paper, we introduce the notion of the weak set-labeling number of a graph $G$ as the minimum cardinality of $X$ so that $G$ admits a WIASL with respect to the ground set $X$ and discuss the weak set-labeling number of certain graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。