Results 41 to 50 of about 7,663 (277)
Alpha Labeling of Amalgamated Cycles
Theory and Applications of Graphs, 2022 A graceful labeling of a bipartite graph is an \a-labeling if it has the property that the labels assigned to the vertices of one stable set of the graph are smaller than the labels assigned to the vertices of the other stable set.
Christian Barrientos
doaj +1 more source
Discrete Mathematics, 1991 This paper deals with so-called \(d\)-Skolem labelled graphs and \(d\)-hooked Skolem labelled graphs. After quoting and representing main results in terms of \(d\)-Skolem labelled graphs the authors prove a lot of new theorems. Most of them give new classes of \(d\)-Skolem labelled graphs.
Mendelsohn, E., Shalaby, N.
openaire +2 more sources
Distance antimagic labeling of join and corona of two graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices .
A.K. Handa +3 more
doaj +1 more source
Antimagicness for a family of generalized antiprism graphs
Electronic Journal of Graph Theory and Applications, 2014 An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of integers $\{1,2,\dots, |E|\}$ such that all vertex weights are pairwise distinct, where the weight of a vertex is the sum of all edge labels incident with ...
Dominique Buset +3 more
doaj +1 more source
Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups [PDF]
, 2013 We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian group.
Cherniavsky, Yonah +2 more
core
Electronic Notes in Discrete Mathematics, 2017 This paper contains part of a keynote talk at IWOGL 2016, Krakow, Poland, July 7-9 ...
openaire +3 more sources
Indonesian Journal of Combinatorics, 2020 In a quite general sense, additive vertex labelings are those functions that assign nonnegative integers to the vertices of a graph and the weight of each edge is obtained by adding the labels of its end-vertices.
Christian Barrientos
doaj +1 more source
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS Letters, EarlyView.Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
Magic graphs and the faces of the Birkhoff polytope [PDF]
, 2004 Magic labelings of graphs are studied in great detail by Stanley and Stewart. In this article, we construct and enumerate magic labelings of graphs using Hilbert bases of polyhedral cones and Ehrhart quasi-polynomials of polytopes. We define polytopes of
Ahmed, Maya Mohsin
core
-labeling numbers of square of paths
AKCE International Journal of Graphs and Combinatorics, 2017 For , the -labeling arose from code assignment problem. That is, let , and be positive numbers, an --labeling of a graph is a mapping such that if , and if . The span of is the difference between the maximum and the minimum numbers assigned by .
Qiong Wu, Wai Chee Shiu
doaj +1 more source