Results 21 to 30 of about 1,632,039 (225)
Graceful Labeling of Hypertrees
Journal of Mathematics Research, 2021 Graph labeling is considered as one of the most interesting areas in graph theory. A labeling for a simple graph G (numbering or valuation), is an association of non -negative integers to vertices of G (vertex labeling) or to edges of G (edge labeling) or both of them.
H. El-Zohny +3 more
openaire +2 more sources
Odd Harmonious Labeling of Some Graphs [PDF]
, 2012 The labeling of discrete structures is a potential area of research due to its wide range of applications.
Shah, N.H., Vaidya, S.K.
core +1 more source
International Journal of Engineering & Technology, 2018 A graph G with m vertices and n edges, is said to be prime graceful labeling, if there is an injection from the vertices of G to {1, 2, ..., k} where k = min {2m, 2n} such that gcd ( ( ), ( )=1 and the induced injective function from the edges of G to {1, 2, ..., k − 1} defined by ( ) = | ( ) − ( ) | , the resulting edge labels are distinct. In
T. Hameed Hassan, R. Mohammad Abbas
openaire +2 more sources
Graceful Labelling of Edge Amalgamation of Cycle Graph
Journal of Physics: Conference Series, 2018 There are various topics in graph theory. The theory of labelling is one of the topics in graph theory. The theory of labelling was introduced firstly by Alex Rosa in 1967.
D. E. Nurvazly, K. Sugeng
semanticscholar +1 more source
Special Graceful Labelings of Irregular Fences and Lobsters
Universal Journal of Mathematics and Applications, 2019 Irregular fences are subgraphs of $P_m \times P_n$ formed with $m$ copies of $P_n$ in such a way that two consecutive copies of $P_n$ are connected with one or two edges; if two edges are used, then they are located in levels separated an odd number of ...
Christian Barrientos
doaj +1 more source
A Translational Approach to Constraint Answer Set Solving [PDF]
, 2010 We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic
Drescher, Christian, Walsh, Toby
core +2 more sources
Odd graceful labeling on the Ilalang graph (Sn , 3) it’s variation
, 2021 A graph called odd graceful graph if there is an injective mapping f:V(G) → {0,1,2,…,2q − 1} such that for each edge xy 6 E(G) labeled by |f(u) − f(v)|, and the results willform a label on the edge {1,3,5, …,2q − 1} which is bijective.
Z. Amri +3 more
semanticscholar +1 more source
GRACEFUL LABELING OF HANGING THETA GRAPHS [PDF]
International Journal of Pure and Apllied Mathematics, 2013 Summary: In this paper, we introduce a new class of hanging theta graphs and prove that those graphs admit graceful labeling.
Janakiraman, T. N., Sathiamoorthy, G.
openaire +1 more source
Extending of Edge Even Graceful Labeling of Graphs to Strong
Journal of Mathematics, 2021 Edge even graceful labeling of a graph G with p vertices and q edges is a bijective
Mohamed R. Zeen El Deen, Nora A. Omar
openaire +3 more sources
Automatically generating streamlined constraint models with ESSENCE and CONJURE [PDF]
, 2015 Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution.
AM Frisch +11 more
core +1 more source