Results 11 to 20 of about 919,081 (302)
On H-irregular reflexive labeling of graph
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 By an irregular reflexive labeling, we mean a function and such that if and if , where max . Let , the irregular reflexive labeling is called an -irregular reflexive -labeling of graph if every two different sub graphs and isomorphic to , it ...
Marsidi Marsidi +4 more
doaj +2 more sources
SUPERMAGIC LABELING DARI GRAPH
, 2022 ABSTRAK SUPERMAGIC LABELING DARI GRAPH SINTIA NOVITA SARI BR. TAMBA F1A018042 Supermagic labeling adalah pemberian label pada himpunan edge suatu graph dengan himpunan bilangan bulat positif yang berurutan sehingga untuk setiap vertex jumlah ...
Baki, Swita +2 more
core +4 more sources
Distance labeling in graphs [PDF]
Journal of Algorithms, 2004 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 +5 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
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
--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
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
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
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
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