scholarly journals On Harmonious Labeling of Corona Graphs

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

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.

scholarly journals Harmonious labeling for the corona graphs of small complete graph

2019 ◽  
Author(s):  
A. G. Pradana ◽  
B. Utami ◽  
D. R. Silaban ◽  
K. A. Sugeng
Keyword(s):  
Complete Graph ◽  
Harmonious Labeling ◽  
Corona Graphs

scholarly journals Super edge bimagic harmonious labeling of some Corona graphs

2020 ◽  
Vol S (1) ◽  
pp. 487-490
Author(s):  
L. Merrit Anish ◽  
M. Regees ◽  
T. Nicholas
Keyword(s):  
Harmonious Labeling ◽  
Corona Graphs

scholarly journals Edge even graceful labeling of some corona graphs

2021 ◽  
Vol 1872 (1) ◽  
pp. 012007
Author(s):  
D Jayantara ◽  
Purwanto ◽  
S Irawati
Keyword(s):  
Graceful Labeling ◽  
Corona Graphs

SELF-ORGANIZED CORONA GRAPHS: A DETERMINISTIC COMPLEX NETWORK MODEL WITH HIERARCHICAL STRUCTURE

2019 ◽  
Vol 22 (06) ◽  
pp. 1950019
Author(s):  
ROHAN SHARMA ◽  
BIBHAS ADHIKARI ◽  
TYLL KRUEGER
Keyword(s):  
Power Law ◽  
Small World ◽  
Self Organization ◽  
Scale Free ◽  
Self Organized ◽  
Power Law Exponent ◽  
Growing Networks ◽  
Growing Network ◽  
Hierarchical Pattern ◽  
Corona Graphs

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.

scholarly journals Coloring, location and domination of corona graphs

2013 ◽  
Vol 86 (1-2) ◽  
pp. 1-21 ◽  
Author(s):  
Ismael González Yero ◽  
Dorota Kuziak ◽  
Amauris Rondón Aguilar
Keyword(s):  
Corona Graphs

scholarly journals Regular Graphs and Corona Graphs Based on Special Type of Labeling

2019 ◽  
Vol 9 (2) ◽  
pp. 2662-2664
Keyword(s):  
Regular Graphs ◽  
Corona Graphs ◽  
Edge Labeling

Here we consider the special type of labeling as lucky edge labeling for Regular graphs and corona graphs.

Sign in / Sign up

Export Citation Format

Share Document