scholarly journals Radio labeling on some corona graphs

2020 ◽  
Author(s):  
J. Uma ◽  
R. Monju Bhargavi
Keyword(s):  
Drug Delivery ◽  
2021 ◽  
Vol 28 (1) ◽  
pp. 1524-1538
Author(s):  
Sinar Sayed ◽  
Fatma M. Elsharkawy ◽  
Maha M. Amin ◽  
Hesham A. Shamsel-Din ◽  
Ahmed B. Ibrahim

2021 ◽  
Vol 1872 (1) ◽  
pp. 012007
Author(s):  
D Jayantara ◽  
Purwanto ◽  
S Irawati

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
K. Mageshwaran ◽  
G. Kalaimurugan ◽  
Bussakorn Hammachukiattikul ◽  
Vediyappan Govindan ◽  
Ismail Naci Cangul

An L h , k -labeling of a graph G = V , E is a function f : V ⟶ 0 , ∞ such that the positive difference between labels of the neighbouring vertices is at least h and the positive difference between the vertices separated by a distance 2 is at least k . The difference between the highest and lowest assigned values is the index of an L h , k -labeling. The minimum number for which the graph admits an L h , k -labeling is called the required possible index of L h , k -labeling of G , and it is denoted by λ k h G . In this paper, we obtain an upper bound for the index of the L h , k -labeling for an inverse graph associated with a finite cyclic group, and we also establish the fact that the upper bound is sharp. Finally, we investigate a relation between L h , k -labeling with radio labeling of an inverse graph associated with a finite cyclic group.


2020 ◽  
Vol 15 (6) ◽  
pp. 752-758
Author(s):  
Qian Wang ◽  
Wangxi Hai ◽  
Sanyuan Shi ◽  
Jinliang Peng ◽  
Yuhong Xu
Keyword(s):  
Pet Ct ◽  

2019 ◽  
Vol 22 (06) ◽  
pp. 1950019
Author(s):  
ROHAN SHARMA ◽  
BIBHAS ADHIKARI ◽  
TYLL KRUEGER

In this paper, we propose a self-organization mechanism for newly appeared nodes during the formation of corona graphs that define a hierarchical pattern in the resulting corona graphs and we call it self-organized corona graphs (SoCG). We show that the degree distribution of SoCG follows power-law in its tail with power-law exponent approximately 2. We also show that the diameter is less equal to 4 for SoCG defined by any seed graph and for certain seed graphs, the diameter remains constant during its formation. We derive lower bounds of clustering coefficients of SoCG defined by certain seed graphs. Thus, the proposed SoCG can be considered as a growing network generative model which is defined by using the corona graphs and a self-organization process such that the resulting graphs are scale-free small-world highly clustered growing networks. The SoCG defined by a seed graph can also be considered as a network with a desired motif which is the seed graph itself.


2014 ◽  
Vol 2014 ◽  
pp. 1-4 ◽  
Author(s):  
Martin Bača ◽  
Maged Z. Youssef

A graphGwithqedges is said to be harmonious, if there is an injectionffrom the vertices ofGto the group of integers moduloqsuch that when each edgexyis assigned the labelf(x)+f(y)(modq), the resulting edge labels are distinct. In this paper, we study the existence of harmonious labeling for the corona graphs of a cycle and a graphGand for the corona graph ofK2and a tree.


Sign in / Sign up

Export Citation Format

Share Document