Neighborhood Prime Labeling in Some Product And Power Digraphs
نویسندگان
چکیده
Let D(p, q) be a digraph. A function f: V → {1, 2, ..., n} is said to neighborhood prime labeling of D if it both in and out degree labeling. In this paper, we introduce the concept digraphs also investigate existence some digraphs.
منابع مشابه
Prime and Prime Cordial Labeling for Some Special Graphs
A graph G(V,E) with vertex set V is said to have a prime labeling if its vertices are labeled with distinct integers 1, 2, . . . , |V | such that for each edge xy ∈ E the labels assigned to x and y are relatively prime. A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, . . . , |V |} such that if each edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 ...
متن کامل$4$-Total prime cordial labeling of some cycle related graphs
Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...
متن کاملPrime Cordial Labeling of Some Graphs
In this paper we prove that the split graphs of 1,n K and are prime cordial graphs. We also show that the square graph of is a prime cordial graph while middle graph of is a prime cordial graph for . Further we prove that the wheel graph admits prime cordial labeling for . , n n B n , n n B n P 8 4 n
متن کاملNeighborhood hypergraphs of digraphs and some matrix permutation problems
Given a digraph D, the set of all pairs (N−(v), N(v)) constitutes the neighborhood dihypergraph N (D) of D. The Digraph Realization Problem asks whether a given dihypergraph H coincides with N (D) for some digraph D. This problem was introduced by Aigner and Triesch [2] as a natural generalization of the Open Neighborhood Realization Problem for undirected graphs, which is known to be NP-comple...
متن کاملSecond Neighborhood via First Neighborhood in Digraphs
Let D be a simple digraph without loops or digons. For any v ∈ V (D), the first out-neighborhood N(v) is the set of all vertices with out-distance 1 from v and the second neighborhood N(v) of v is the set of all vertices with out-distance 2 from v. We show that every simple digraph without loops or digons contains a vertex v such that |N++(v)| ≥ γ|N+(v)|, where γ = 0.657298 . . . is the unique ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of physics
سال: 2021
ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']
DOI: https://doi.org/10.1088/1742-6596/1947/1/012040