Prime labeling of line and splitting graph of brush graph
Abstract A bijective function f from V ( G ) to {1,2,…, n } be a prime labeling of a graph G with n order if for every u, v ∈ V ( G ) such that e = uv ∈ E ( G ), f ( u ) and f ( v ) relatively prime. A prime graph is a graph which admits prime labeling. In this study, we investigate and conclude tha...
Saved in:
| Published in | Journal of physics. Conference series Vol. 2106; no. 1; pp. 12030 - 12037 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
IOP Publishing
01.11.2021
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | Abstract
A bijective function
f
from
V
(
G
) to {1,2,…,
n
} be a prime labeling of a graph
G
with
n
order if for every
u, v
∈
V
(
G
) such that
e
=
uv
∈
E
(
G
),
f
(
u
) and
f
(
v
) relatively prime. A prime graph is a graph which admits prime labeling. In this study, we investigate and conclude that the line and splitting graph of the brush graph is a prime graph. |
|---|---|
| ISSN: | 1742-6588 1742-6596 |
| DOI: | 10.1088/1742-6596/2106/1/012030 |