Results 221 to 230 of about 1,000,377 (259)
Some of the next articles are maybe not open access.
Aequationes Mathematicae, 2022
Graceful labeling and antimagic labeling are two significant topics in the domain of graph labelings, with outstanding conjectures which still remain unsolved. In this paper, the authors combine these two concepts to define a new labeling, called graceful antimagic labelings. Graceful antimagicness of some families of trees, cycles, and nearly complete
Mohammed Ali Ahmed +2 more
exaly +3 more sources
Graceful labeling and antimagic labeling are two significant topics in the domain of graph labelings, with outstanding conjectures which still remain unsolved. In this paper, the authors combine these two concepts to define a new labeling, called graceful antimagic labelings. Graceful antimagicness of some families of trees, cycles, and nearly complete
Mohammed Ali Ahmed +2 more
exaly +3 more sources
Absolute Mean Graceful Labeling of Jewel Graph and Jelly Fish Graph
International Journal of Mathematics Trends and Technology, 2022In this paper, we present absolute mean graceful labeling for some graphs. We have proved that jewel graph Jn, jewel graph without prime edge Jn ∗ , extended jewel graph EJn, jelly fish graph Jm,n, jelly fish graph without prime edge Jm,n ∗ , extended ...
Akbari P Z, K. V J, Parmar N A
semanticscholar +1 more source
Graceful labeling of power graph of group Z2k−1 × Z4
Asian-European Journal of Mathematics, 2021The power graph of a finite group G is a special type of undirected simple graph whose vertex set is set of elements of G, in which two distinct vertices of G are adjacent if one is the power of other.
Amit Sehgal +3 more
semanticscholar +1 more source
SIAM Journal on Algebraic Discrete Methods, 1985
This very interesting paper introduces the concept of graceful directed graphs as follows. A digraph D with e arcs is numbered by assigning a distinct integer value h(v) from \(\{\) 0,1,...,e\(\}\) to each node v. Each arc (u,v) receives a value \(h(u,v)=h(v)-h(u)\) (mod e\(+1)\).
Bloom, G. S., Hsu, D. F.
openaire +1 more source
This very interesting paper introduces the concept of graceful directed graphs as follows. A digraph D with e arcs is numbered by assigning a distinct integer value h(v) from \(\{\) 0,1,...,e\(\}\) to each node v. Each arc (u,v) receives a value \(h(u,v)=h(v)-h(u)\) (mod e\(+1)\).
Bloom, G. S., Hsu, D. F.
openaire +1 more source
Czechoslovak Mathematical Journal, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Acharya, Mukti, Singh, Tarkeshwar
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Acharya, Mukti, Singh, Tarkeshwar
openaire +2 more sources
ODD GRACEFUL LABELINGS OF GRAPHS
Discrete Mathematics, Algorithms and Applications, 2009A 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 +2 more
openaire +1 more source
2016
Let $$G=V,E$$ be a p,i¾źq-graph without isolated vertices. The gracefulness gracG of G is the smallest positive integer k for which there exists an injective function $$f:V\rightarrow \{0,1,2,\dots , k\}$$ such that the edge induced function $$g_f:E\rightarrow \{1,2,\dots , k\}$$ defined by $$g_fuv=|fu-fv|$$, $$\forall uv \in E$$ is also injective. Let
Jessica Pereira +2 more
openaire +1 more source
Let $$G=V,E$$ be a p,i¾źq-graph without isolated vertices. The gracefulness gracG of G is the smallest positive integer k for which there exists an injective function $$f:V\rightarrow \{0,1,2,\dots , k\}$$ such that the edge induced function $$g_f:E\rightarrow \{1,2,\dots , k\}$$ defined by $$g_fuv=|fu-fv|$$, $$\forall uv \in E$$ is also injective. Let
Jessica Pereira +2 more
openaire +1 more source
Constraint models for graceful graphs
Constraints, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barbara M. Smith, Jean-François Puget
openaire +1 more source
Edge consecutive gracefulness of a graph
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jessica Pereira +2 more
openaire +1 more source
JP Journal of Algebra, Number Theory and Applications, 2019
A simple, connected graph \(G(V,E)\) is graceful [\textit{J. A. Gallian}, Electron. J. Comb. DS06, Research paper DS6, 43 p. (1998; Zbl 0953.05067)] if there exists an injective mapping \(f:V\to\{0,1,\dots,|V|\}\), under which all differences in \(\{|f(u)-f(v)|:uv\in E\}\) are distinct. In the \(n\times m\) geometrical king's graph (representing king's
Susanti, Yeni +4 more
openaire +2 more sources
A simple, connected graph \(G(V,E)\) is graceful [\textit{J. A. Gallian}, Electron. J. Comb. DS06, Research paper DS6, 43 p. (1998; Zbl 0953.05067)] if there exists an injective mapping \(f:V\to\{0,1,\dots,|V|\}\), under which all differences in \(\{|f(u)-f(v)|:uv\in E\}\) are distinct. In the \(n\times m\) geometrical king's graph (representing king's
Susanti, Yeni +4 more
openaire +2 more sources