Results 91 to 100 of about 209,693 (137)
Graceful centers of graceful graphs and universal graceful graphs
, 2019 In this paper we define graceful center of a graceful graph. We proved any graph G which admits α-labeling has at least four graceful centers. We also defined a new strong concept of universal graceful graph.
Makadia, H. M. +2 more
core +1 more source
Graceful labeling of triangular extension of complete bipartite graph
Electronic Journal of Graph Theory and Applications, 2019 For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km, n ⊙ K2 as triangular extension of complete bipartite graph Km, n, since there is a triangle hanging from every vertex of Km, n.
Sarbari Mitra, Soumya Bhoumik
doaj +1 more source
On graceful labelings of trees
, 2018 We prove via a composition lemma, the Kotzig-Ringel-Rosa conjecture, better known as the Graceful Labeling Conjecture. We also prove via a stronger version of the composition lemma a stronger form of the Graceful Labeling Conjecture.
openaire +2 more sources
Graceful Labeling For bipartite graceful Graphs and related Graphs
, 2020 The concept of graceful labels was proposed by Rosa, scholars began to study graceful labels of various graphs and obtained relevant results.Let the graph is a bipartite graceful graph, we have proved some graphs are graceful labeling in this paper.
Liu, Chunfeng +2 more
openaire +2 more sources
Graceful Labeling on Grids in 3-Dimensions and 4-Dimensions
, 2007 優美標號(Graceful labeling)最早是由Rosa在1966年提出。一個graph G上的端點標號(vertex labeling)所指的是一個vertex的函數f對應到一些數值(即標號)，而G上的每一edge xy 被指定一個由f(x)和f(y)所決定的數值。如果這樣的一個f:V-->{0,1,...|E|}是單射，且指定 edge xy 的數值為|f(x)-f(y)|而所有的edge都被指定不同的數值，則f被稱為一個優美標號。 Rosa提出假說猜測所有的tree都有優美標號 ...
Chen, Yi-xian, 陳奕先
core
On the Number of α-Labeled Graphs
Discussiones Mathematicae Graph Theory, 2018 When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research ...
Barrientos Christian, Minion Sarah
doaj +1 more source
Edge even graceful labeling of torus grid graph
, 2020 We study the family of torus grid graphs. We also obtain necessary and sufficent conditions to be edge even graceful labeling for all of the cases of every member of this ...
Saleh, Wedad, Daoud, Salama Nagy
core +1 more source
Counting and labeling grid related graphs
Electronic Journal of Graph Theory and Applications, 2019 In this work we explore some graphs associated with the grid Pm × Pn. A fence is any subgraph of the grid obtained by deleting any feasible number of edges from some or all the copies of Pm.
Christian Barrientos, Sarah Minion
doaj +1 more source
Super Fibonacci Graceful Labeling
, 2014 : A Smarandache-Fibonacci Triple is a sequence S(n), n ≥ 0 such that S(n) = S(n−1)+S(n−2), where S(n) is the Smarandache function for integers n ≥ 0. Certainly, it is a generalization of Fibonacci sequence.
S. Navaneethakrishnan +2 more
core
Vertex graceful labeling of some classes of graphs
, 2018 A connected graph G = (V, E) of order atleast two, with order p and size q is called vertex-graceful if there exists a bijection f : V → {1, 2, 3, ··· p} such that the induced function f * : E → {0, 1, 2, ··· q - 1} defined by f * (uv) = (f(u) + f(v ...
Balaganesan, P., Santhakumaran, A. P.
core +1 more source