Results 21 to 30 of about 1,212,791 (104)
SOME CARTESIAN PRODUCTS OF A PATH AND PRISM RELATED GRAPHS THAT ARE EDGE ODD GRACEFUL [PDF]
, 2021 Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its order and its size. Let $f$ be a bijective edge labeling which codomain is the set of odd integers from 1 up to $2q-1$.
Susanti, Yeni +3 more
core +1 more source
Journal of Mathematics, 2023 In this article, we adapt the edge-graceful graph labeling definition into block designs and define a block design V,B with V=v and B=b as block-graceful if there exists a bijection f:B⟶1,2,…,b such that the induced mapping f+:V⟶Zv given by f+x=∑x∈AA ...
Dilara Erdemir, Emre Kolotoğlu
doaj +1 more source
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Super Fibonacci Graceful Labeling of Some Special Class of Graphs [PDF]
, 2011 A Fibonacci graceful labeling and a super Fibonacci graceful labeling on graphs were introduced by Kathiresan and Amutha in ...
Sridevi, R. +2 more
core +1 more source
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
Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling
, 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 ...
Nora A. Omar, Mohamed R. Zeen El Deen
core +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
Graceful Labeling and Skolem Graceful Labeling on the U-star Graph and It's Application in Cryptography [PDF]
, 2021 Graceful Labeling on graph G=(V, E) is an injective function f from the set of the vertex V(G) to the set of numbers {0,1,2,...,|E(G)|} which induces bijective function f from the set of edges E(G) to the set of numbers {1,2,...,|E(G)|} such that for ...
Yundari, Yundari +2 more
core +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
Divergent Synthesis of Möbius and Hückel N‐Heterocycloarenes From a Common Macrocyclic Backbone
Angewandte Chemie, Volume 138, Issue 37, 7 September 2026.In the divergent synthesis of Möbius and Hückel N‐heterocycloarenes from a common macrocyclic precursor, the annulation reaction dictates topology: Scholl reaction gives Möbius topology, while InCl3‐mediated alkyne annulation gives Hückel topology. The Möbius N‐heterocycloarene is unevenly contorted as revealed by crystal structure, and the Hückel N ...
Han Chen +6 more
wiley +2 more sources