Results 31 to 40 of about 201,420 (145)

On the study of Rainbow Antimagic Coloring of Special Graphs

Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023
Let  be a connected graph with vertex set  and edge set . The bijective function  is said to be a labeling of graph where  is the associated weight for edge .
Dafik Dafik, Riniatul Nur Wahidah, Ermita Rizki Albirri, Sharifah Kartini Said Husain   +3 more
doaj   +1 more source

Assignment Computations Based on Cexp Average in Various Ladder Graphs

Journal of Mathematics, Volume 2022, Issue 1, 2022., 2022
This study introduces the Cexp average assignments and investigates its properties using various ladder graphs. The ladder graphs can be found in every communication networks. Ladder networks are increasingly being used in everyday life for monitoring and environmental applications such as domestic, military, surveillance, industrial, medical ...
A.Rajesh Kannan, P. Manivannan, K. Loganathan, K. Prabu, Sonam Gyeltshen, M. T. Rahim   +5 more
wiley   +1 more source

PEWARNAAN TITIK TOTAL SUPER ANTI-AJAIB LOKAL PADA GRAF PETERSEN DIPERUMUM P(n,k) DENGAN k=1,2

Barekeng, 2021
The local antimagic total vertex labeling of graph G is a labeling that every vertices and edges label by natural number from 1 to  such that every two adjacent vertices has different weights, where is The sum of a vertex label and the labels of all ...
Deddy Setyawan, Anis Nur Afni, Rafiantika Megahnia Prihandini, Ermita Rizki Albirri, Arika Indah Kristiana   +4 more
doaj   +1 more source

On Elegant Labelling and Magic Labelling of Large‐Scale Graphs

Discrete Dynamics in Nature and Society, Volume 2022, Issue 1, 2022., 2022
In this paper, we deduce the equivalence relationship among strongly c‐elegant labelling, super‐edge magic total labelling, edge antimagic total labelling, and super (t, 1)‐magical labelling. We study some properties of the graph with a strongly c‐elegant labelling.
Jing Su, Hongyu Wang, Bing Yao, Akbar Ali   +3 more
wiley   +1 more source

ON RAINBOW ANTIMAGIC COLORING OF SNAIL GRAPH(S_n ), COCONUT ROOT GRAPH (Cr_(n,m) ), FAN STALK GRAPH (Kt_n ) AND THE LOTUS GRAPH(Lo_n )

Barekeng, 2023
Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph  with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah, I I Makhfudloh, Dafik Dafik, RM Prihandini, AC Prihandoko   +4 more
doaj   +1 more source

On Hamilton‐Connectivity and Detour Index of Certain Families of Convex Polytopes

Mathematical Problems in Engineering, Volume 2021, Issue 1, 2021., 2021
A convex polytope is the convex hull of a finite set of points in the Euclidean space ℝn. By preserving the adjacency‐incidence relation between vertices of a polytope, its structural graph is constructed. A graph is called Hamilton‐connected if there exists at least one Hamiltonian path between any of its two vertices.
Sakander Hayat, Muhammad Yasir Hayat Malik, Ali Ahmad, Suliman Khan, Faisal Yousafzai, Roslan Hasni, Abdul Qadeer Khan   +6 more
wiley   +1 more source

Computing Edge Weights of Symmetric Classes of Networks

Mathematical Problems in Engineering, Volume 2021, Issue 1, 2021., 2021
Accessibility, robustness, and connectivity are the salient structural properties of networks. The labelling of networks with numeric numbers using the parameters of edge or vertex weights plays an eminent role in the study of the aforesaid properties.
Hafiz Usman Afzal, Muhammad Javaid, Abdulaziz Mohammed Alanazi, Maryam Gharamah Alshehri, Ali Ahmad   +4 more
wiley   +1 more source

Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index

Complexity, Volume 2021, Issue 1, 2021., 2021
A connected graph is called Hamilton‐connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton‐connected is an NP‐complete problem. Hamiltonian and Hamilton‐connected graphs have diverse applications in computer science and electrical engineering.
Sakander Hayat, Asad Khan, Suliman Khan, Jia-Bao Liu, M. Irfan Uddin   +4 more
wiley   +1 more source

A Conjecture on Super Edge‐Magic Total Labeling of 4‐Cycle Books

International Journal of Mathematics and Mathematical Sciences, Volume 2021, Issue 1, 2021., 2021
A graph G is called cycle books B[(4, m), 2] if G consists of m cycles C4 with a common path P2. Figueroa‐Centeno, Ichishima, and Muntaner‐Batle conjecture that the graph B[(4, m), 2] is super edge‐magic total if and only if m is even or m ≡ 5 mod(8). In this article, we prove this conjecture for m ≥ 36 and m = 0 mod (2).
Mudin Simanihuruk, Tri Atmojo Kusmayadi, Baki Swita, Minsi Romala, Friska Damanik, Sergejs Solovjovs   +5 more
wiley   +1 more source

New Perspectives on Classical Meanness of Some Ladder Graphs

Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021
In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an important role in the area of communication networks, coding theory, and transportation engineering. Also, we found interesting new results corresponding to classical mean labeling for some ladder‐related graphs and corona of ladder graphs with suitable ...
A. M. Alanazi, G. Muhiuddin, A. R. Kannan, V. Govindan, A. H. Kara   +4 more
wiley   +1 more source