Results 11 to 20 of about 882,414 (306)
THE HARMONIOUS, ODD HARMONIOUS, AND EVEN HARMONIOUS LABELING
Barekeng, 2022 Suppose is a simple and connected graph with edges. A harmonious labeling on a graph is an injective function so that there exists a bijective function where for each An odd harmonious labeling on a graph is an injective function from to non ...
Ahmad Lasim +2 more
doaj +1 more source
Journal of Function Spaces, 2022 Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences.
A. El-Mesady +2 more
doaj +1 more source
Shifted-Antimagic Labelings for Graphs [PDF]
Graphs and Combinatorics, 2021 The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graphs are known to be antimagic, but little has been known about sparse graphs, not even trees.
Fei-Huang Chang +3 more
openaire +3 more sources
Some New Results on Lucky Labeling
مجلة بغداد للعلوم, 2023 Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair ...
J. Ashwini +2 more
doaj +1 more source
A Bibliometric Analysis of Graph Labeling Study Using VOSviewer
International Journal of Informatics, Information System and Computer Engineering, 2023 Graph labeling is a well-known theme of graph theory that involves an assignment of integers to the domain elements such as vertices or edges, or both, subject to certain conditions.
Yoong Kooi Kuan +3 more
doaj +1 more source
--supermagic labeling of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 A simple graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . The graph is said to be -magic if there exists a total labeling such that for every subgraph of isomorphic to , is constant. Additionally, the labeling is called - supermagic labeling if .
C. Chithra, G. Marimuthu, G. Kumar
openaire +3 more sources
On labeling in graph visualization [PDF]
Information Sciences, 2007 When visualizing graphs, it is essential to communicate the meaning of each graph object via text or graphical labels. Automatic placement of labels in a graph is an NP-Hard problem, for which efficient heuristic solutions have been recently developed.
Ugur Dogrusöz +3 more
openaire +3 more sources
Super Fibonacci Graceful Labeling [PDF]
, 2011 Approaching topics such as Smarandache-Fibonacci triple, graceful labeling, Fibonacci graceful labeling, super Smarandache-Fibonacci graceful graph, super Fibonacci graceful ...
Sridevi, R. +2 more
core +1 more source
Solution of a Conjecture on Skolem Mean Graph [PDF]
, 2011 A paper treating about Smarandachely super m-mean graph, skolem mean labeling, Skolem mean graph ...
Balaji, V.
core +1 more source
Neutrosophic Labeling Graph [PDF]
Neutrosophic Sets and Systems, 2019 In this paper, some new connectivity concepts in neutrosophic labeling graphs are portrayed. Definition of neutrosophic strong arc, neutrosophic partial cut node, Neutrosophic Bridge and block are introduced with examples.
M. Gomathi, V. Keerthika
doaj +1 more source