Results 11 to 20 of about 2,422,838 (348)
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 +3 more sources
Harmonic Labeling of Graphs [PDF]
Discrete Mathematics, 2010 Which graphs admit an integer value harmonic function which is injective and surjective onto $\Z$? Such a function, which we call harmonic labeling, is constructed when the graph is the $\Z^2$ square grid.
Benjamini, Itai +3 more
core +3 more sources
Graphs with Flexible Labelings [PDF]
Discrete & Computational Geometry, 2018 For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings. The characterization is based on colorings of the edges with restrictions on the cycles.
Georg Grasegger +2 more
openaire +4 more sources
Labelling the axes of graphs … [PDF]
Nature, 1985 Nature 316, 489 (1985). IN this Scientific Correspondence contribution, the third paragraph should begin: 'The example quoted above requires the observation that if "Radioactivity = 5 x 103 c.p.m." then "5 = (Radioactivity ? l(T3)/c.p.m." or "5 = 103 (Radioactivity/c.p.m.)" or "5 = Radioactivity/(C.p.
+11 more sources
Distance labeling in graphs [PDF]
Journal of Algorithms, 2004 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
On Proper Labellings of Graphs with Minimum Label Sum [PDF]
Algorithmica, 2020 The 1-2-3 Conjecture states that every nice graph G (without component isomorphic to [Formula: see text]) admits a proper 3-labelling, i.e., a labelling of the edges with 1, 2, 3 such that no two adjacent vertices are incident to the same sum of labels.
Bensmail, Julien +2 more
openaire +6 more sources
Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling
Journal of Mathematics, 2021 Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge EG to the set of positive integers 2,4,…,2q such that all the vertex labels f∗VG, given by f∗u=∑uv∈EGfuvmod2k, where k=maxp,q, are pairwise ...
Mohamed R. Zeen El Deen, Nora A. Omar
doaj +1 more source
ODD HARMONIC LABELING ON Cm,n ⊵e C4 GRAPH
Jurnal Diferensial, 2023 Graph is an ordered pair of a vertex and edge set that related with various theories, one of them called labeling. There are a lot of types of graph labeling, one of them is odd harmonious labeling. The odd harmonious labeling is an injective function f :
Demetriana Kolo +2 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. Kumar, G. Marimuthu
openaire +3 more sources
On Antimagic Labeling for Some Families of Graphs
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023 Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct.
Noor K. Shawkat, Mohammed A. Ahmed
doaj +1 more source