Read More
Date: 20-5-2022
![]()
Date: 20-4-2022
![]()
Date: 6-4-2022
![]() |
Let be a finite, connected, undirected graph with graph diameter
and graph distance
between vertices
and
. A radio labeling of a graph
is labeling using distinct nonnegative integers such that
for every pair of distinct vertices
,
in the vertex set of
. Then the radio number of
, commonly denoted
, is the smallest integer
such that
has a radio labeling
with
.
The smallest integer such that
has a radio labeling
with
is known as the radio number of
, commonly denoted
.
Define . A radio labeling
of
is optimal if
.
|
|
للعاملين في الليل.. حيلة صحية تجنبكم خطر هذا النوع من العمل
|
|
|
|
|
"ناسا" تحتفي برائد الفضاء السوفياتي يوري غاغارين
|
|
|
|
|
المجمع العلمي يقيم ورشة تطويرية ودورة قرآنية في النجف والديوانية
|
|
|