Results 11 to 20 of about 100,347 (247)
THE HARMONIOUS, ODD HARMONIOUS, AND EVEN HARMONIOUS LABELING
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
Distance labeling in graphs [PDF]
Summary: We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additional information). Our main interest is in the minimal length of labels needed in different cases.
Gavoille, Cyril +3 more
openaire +3 more sources
Some New Results on Lucky Labeling
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
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
A Bibliometric Analysis of Graph Labeling Study Using VOSviewer
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
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening 50 years nearly 200 graph labelings techniques have been studied in over 2000 papers. Finding out what has been done for any particular kind of labeling and keeping up
openaire +1 more source
Summarizing Labeled Multi-graphs
17 pages, 8 figures, 4 ...
Berberidis, Dimitris +2 more
openaire +2 more sources
Odd Fibonacci Stolarsky-3 Mean Labeling of Some Special Graphs
Let G be a graph with p vertices and q edges and an injective function where each is a odd Fibonacci number and the induced edge labeling are defined by and all these edge labeling are distinct is called Odd Fibonacci Stolarsky-3 Mean Labeling.
M Sree Vidya, S.S Sandhya
doaj +1 more source
On labeled graph $C^*$-algebras
Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labeled graph $C^*$-algebra by taking a weakly left--resolving labeled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal generating family of partial isometries and projections.
Banjade, Debendra P., Ephrem, Menassie
openaire +4 more sources
L(2,1)—labeling of the bracelet graph
In order to better study the channel assignment problem, a function from the vertex set to the set of all nonnegative integers is generated, that is the L(2,1)—labeling of a graph. Let the least label be zero, the L(2,1)—labeling number of a graph is the
Haiping LI, Ying YANG
doaj +1 more source

