论文标题
亲切的图像
Cordial Digraphs
论文作者
论文摘要
$（0,1）$ - 集合的标签据说是友好的，如果标记为0的集合的元素数量，并且标记为1的数字最多有所不同。让$ g $是由Verex Set的标签$ f $ f $ f $ f $ f $ f的标签。如果$ g $和$ f $都是友好的，那么$ g $据说是该图的亲切标签。我们将此概念扩展到定向图并研究有向图的诚意。我们表明所有有向路径和所有定向周期都是亲切的。我们还讨论了定向树和其他挖掘物的亲切性。
A $(0,1)$-labeling of a set is said to be friendly if the number of elements of the set labeled 0 and the number labeled 1 differ by at most 1. Let $g$ be a labeling of the edge set of a graph that is induced by a labeling $f$ of the vertex set. If both $g$ and $f$ are friendly then $g$ is said to be a cordial labeling of the graph. We extend this concept to directed graphs and investigate the cordiality of directed graphs. We show that all directed paths and all directed cycles are cordial. We also discuss the cordiality of oriented trees and other digraphs.
