Results 11 to 20 of about 1,000,377 (259)
A survey and a new class of graceful unicylic graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graph G admits a graceful labeling if there is a one-to-one map f from the set of vertices of G to such that when an edge xy is assigned the label the resulting set of edge labels is When such a labeling exists, G is called graceful. Rosa showed that a
Max Pambe Biatch’ +2 more
doaj +2 more sources
Edge odd graceful labeling of some path and cycle related graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Solairaju and Chithra introduced a new type of labeling of a graph with vertices and edges called an edge odd graceful labeling if there is a bijection from the edges of the graph to the set such that, when each vertex is assigned the sum of all edges ...
S.N. Daoud
doaj +2 more sources
Odd-Graceful Total Colorings for Constructing Graphic Lattice
Mathematics, 2021 The security of passwords generated by the graphic lattices is based on the difficulty of the graph isomorphism, graceful tree conjecture, and total coloring conjecture.
Jing Su, Hui Sun, Bing Yao
doaj +3 more sources
Additively graceful signed graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Let [Formula: see text] be a signed graph of order p and size q. Let [Formula: see text] and [Formula: see text] Let [Formula: see text] be an injective function and let [Graphic: see text]gf(uv)={|f(u)−f(v)| if uv∈E+f(u)+f(v) if uv∈E−The function f is ...
Jessica Pereira +2 more
doaj +2 more sources
Electronic Notes in Discrete Mathematics, 2015 Abstract A total graceful labeling (TGL) of a ( p , q ) graph G is a bijection f from V ( G ) ∪ E ( G ) to the set { 1 , 2 , 3 , … , p + q } so that f ( u v ) = | f ( u ) − f ( v ) | for all u v ∈ E ( G ) . A TGL is called a super if f ( E ) = { 1 , 2 , 3 , … ,
S. P. Subbiah +2 more
exaly +2 more sources
Electronic Notes in Discrete Mathematics, 2009 Abstract Graph labeling of a graph was introduced by Rosa [A. Rosa, “Theory of graphs” (International Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris (1967) 349-355] and the concept of an edge graceful labeling was introduced by Lo [S. Lo, “On edge graceful labeling of graphs”, Congress Numer., 50(1985) 231-241]. We introduced a
A Solairaju
exaly +2 more sources
Edge even graceful labelling of new families of graphs
Journal of Taibah University for Science, 2019 Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such that ...
S. N. Daoud, Ahmed N. Elsawy
doaj +2 more sources
Construction of Certain Infinite Families of Graceful Graphs form a Given Graceful Graph
Defence Science Journal, 1982 Two general methods of constructing an infinite sequence(G=G/sub1/,G/sub2/....) of graceful graphs Gi such that Gi is contained in Gi/sub+1/ as an induced subgraph, for every given gracefully numbered graph G, is described along with applications of the ...
B. Acharya
semanticscholar +3 more sources
Graceful Labeling of Spider Graphs With at Most Five Legs
Journal of Applied MathematicsA graceful labeling of a graph G with q edges is an injection f from the vertices of G to the set 0,1,⋯,q such that, when each edge uv is assigned the label fu−fv, the resulting edge labels are distinct.
A. Panpa, S. Imnang, T. Wasuanankul
doaj +2 more sources
Graceful Labeling of some Join Graphs and the Subdivision of Complete Bipartite Graphs
Journal of Applied MathematicsThe join of graphs G and H, denoted by G+H, is the graph obtained from the disjoint union of G and H by joining each vertex in G to each vertex in H. An edge uw is said to be subdivided if uw is replaced by the path P:uvw, where v is the new vertex.
A. Panpa, P. Chaiprasert, C. Tisklang
doaj +2 more sources