scholarly journals A Graceful Labeling of Square of Path Graph with Quadratic Complexity Algorithm

2021 ◽  
Vol 20 ◽  
pp. 378-386
Author(s):  
Faris M. Taweel ◽  
Eman A. Abuhijleh ◽  
Shorouq Ali
Keyword(s):  
Graceful Labeling ◽  
Path Graph ◽  
Complexity Algorithm

A method for relaxed graceful labeling of P2n graphs is presented together with an algorithm designed for labeling these graphs. Graceful labeling is achieved by relaxing the range to 2m and perform the labeling using an algorithm with quadratic complexity (O(n2)). The algorithm can be used for labeling any P2n graph with n ≥ 3, as far as the machine can handle the size of the problem.

A Low Complexity Algorithm to Improve Data Rates in LTE MBMS Systems.

2015 ◽  
Vol 4 (1) ◽  
pp. 25-29
Author(s):  
Vidyapogula Naveen ◽  
◽  
S. Thulasi Prasad ◽  
Keyword(s):  
Low Complexity ◽  
Data Rates ◽  
Complexity Algorithm

Super Graceful Labeling for Some Simple Graphs

2012 ◽  
Vol 2 (1) ◽  
pp. 35 ◽  
Author(s):  
M. A. Perumal ◽  
S. Navaneethakrishnan ◽  
A. Nagaraja ◽  
S. Arockiaraj
Keyword(s):  
Graceful Labeling ◽  
Simple Graphs

Graceful Labeling for Some Complete Bipartite Graph

2018 ◽  
Vol 9 (12) ◽  
pp. 2147-2152
Author(s):  
V. Raju ◽  
M. Paruvatha vathana
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Graceful Labeling

G-GRACEFUL LABELING OF GRAPHS

2020 ◽  
Vol 9 (4) ◽  
pp. 1973-1981
Author(s):  
A. Kumar ◽  
V. Kumar ◽  
K. Kumar ◽  
P. Gupta ◽  
Y. Khandelwal
Keyword(s):  
Graceful Labeling

Packing coloring on subdivision-vertex and subdivision-edge join of cycle Cm with path Pn

2020 ◽  
pp. 627-634
Author(s):  
K. Rajalakshmi ◽  
M. Venkatachalam ◽  
M. Barani ◽  
D. Dafik
Keyword(s):  
Chromatic Number ◽  
Path Graph ◽  
Packing Chromatic Number ◽  
Cycle Graph

The packing chromatic number $\chi_\rho$ of a graph $G$ is the smallest integer $k$ for which there exists a mapping $\pi$ from $V(G)$ to $\{1,2,...,k\}$ such that any two vertices of color $i$ are at distance at least $i+1$. In this paper, the authors find the packing chromatic number of subdivision vertex join of cycle graph with path graph and subdivision edge join of cycle graph with path graph.

scholarly journals Complexity and Chimera States in a Network of Fractional-Order Laser Systems

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 341
Author(s):  
Shaobo He ◽  
Hayder Natiq ◽  
Santo Banerjee ◽  
Kehui Sun
Keyword(s):  
Numerical Simulation ◽  
Numerical Solution ◽  
Bifurcation Diagram ◽  
Fractional Order ◽  
Dynamical Model ◽  
Chimera States ◽  
Laser Systems ◽  
Complexity Algorithm ◽  
Derivative Order

By applying the Adams-Bashforth-Moulton method (ABM), this paper explores the complexity and synchronization of a fractional-order laser dynamical model. The dynamics under the variance of derivative order q and parameters of the system have examined using the multiscale complexity algorithm and the bifurcation diagram. Numerical simulation outcomes demonstrate that the system generates chaos with the decreasing of q. Moreover, this paper designs the coupled fractional-order network of laser systems and subsequently obtains its numerical solution using ABM. These solutions have demonstrated chimera states of the proposed fractional-order laser network.

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
Sign in / Sign up

Export Citation Format

Share Document