Results 241 to 250 of about 24,189 (265)

Graph antimagic labeling: A survey

Discrete Mathematics, Algorithms and Applications, 2023
An antimagic labeling of a simple graph [Formula: see text] is a bijection [Formula: see text] such that [Formula: see text] for any two vertices [Formula: see text] in [Formula: see text]. We survey the results about antimagic labelings and other labelings motivated by antimagic labelings of graphs, and present some conjectures and open questions.
Jingxiang Jin, Zhuojie Tu
openaire   +2 more sources

On labelled graph grammars

Computing, 1978
According to the classification of labelled graph grammars by Nagl [4], it can be shown that the class of context-sensitive graph languages is equivalent to the class of context-free graph languages and the context-free graph languages properly include the regular graph languages.
Leon S. Levy, Kang Yueh
openaire   +2 more sources

On sequential labelings of graphs

Journal of Graph Theory, 1983
AbstractA valuation on a simple graph G is an assignment of labels to the vertices of G which induces an assignment of labels to the edges of G. β‐valuations, also called graceful labelings, and α‐valuations, a subclass of graceful labelings, have an extensive literature; harmonious labelings have been introduced recently by Graham and Sloane.
openaire   +2 more sources

Antimagic Labelings of Join Graphs

Mathematics in Computer Science, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Baca, Oudone Phanalasy, Joe Ryan 0001, Andrea Semanicová-Fenovcíková   +3 more
openaire   +1 more source

Enantiomeric Labeling of Reaction Graphs

Journal of Chemical Information and Computer Sciences, 1998
We examine systematically the possibility that a given reaction graph connects enantiomers. We define an enantiomeric labeling as a way to dispose enantiomers on the graph according to specified conditions. Since reaction graphs have to be symmetric, we have derived the set of enantiomeric labelings for every symmetric graph having less than 20 ...
Brocas, Jean, Buekenhout, Francis, Dehon, Michel   +2 more
openaire   +2 more sources

ODD GRACEFUL LABELINGS OF GRAPHS

Discrete Mathematics, Algorithms and Applications, 2009
A graph G = (V(G), E(G)) with q edges is said to be odd graceful if there exists an injection f from V(G) to {0, 1, 2, …, 2q - 1} such that the edge labeling set is {1, 3, 5, …, 2q - 1} with each edge xy assigned the label |f(x) - f(y)|. In this paper, we prove that Pn × Pm (m = 2, 3, 4), generalized crown graphs Cn ⊙ K1,t and gear graphs are odd ...
Zhen-Bin Gao, Xiao-Dong Zhang 0001, Lijuan Xu   +2 more
openaire   +1 more source

Automatic topic labelling for text document using ontology of graph-based concepts and dependency graph

International Journal of Business Information Systems, 2021
Phuc Do
exaly  

Labeled packings of graphs. [PDF]

Australas. J Comb., 2013
Duchene, Eric, Kheddouci, Hamamache, Nowakowski, Richard J., Tahraoui, Mohammed Amin   +3 more
openaire   +1 more source

Antimagic labeling for subdivisions of graphs

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

An application of the combinatorial Nullstellensatz to a graph labelling problem

Journal of Graph Theory, 2010
Dan Hefetz
exaly