Results 221 to 230 of about 848 (243)
Some of the next articles are maybe not open access.
ON PRONIC GRACEFULNESS OF GRAPHS
2023Let G be a graph of order p and size q. A graceful labeling of G is an injection f : V → {0,1,...,q}such that while each edge uv is assigned the label(absolute difference of the corresponding vertex labels), the induced edge labels are all distinct.
S. Akila Devi, V. Jayapriya
openaire +1 more source
Journal of Graph Theory, 1980
AbstractWe give graceful numberings to the following graphs: (a) the union of n K4 having one edge in common, in other words the join of K2 and the union of n disjoint K2 and (b) the union of n C4 having one edge in common, in other words the product of K2 and K1,n, with n + 1 not a multiple of 4.
openaire +2 more sources
AbstractWe give graceful numberings to the following graphs: (a) the union of n K4 having one edge in common, in other words the join of K2 and the union of n disjoint K2 and (b) the union of n C4 having one edge in common, in other words the product of K2 and K1,n, with n + 1 not a multiple of 4.
openaire +2 more sources
All Uniform Bow Graphs are Graceful
Mathematics in Computer Science, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. Jeba Jesintha, K. Ezhilarasi Hilda
openaire +2 more sources
New families of graceful graphs.
Ars Comb., 2003The gracefulness of graphs obtained by the join and union operations is studied. Particularly, the classes \(G\, \cup \, H\) (\(G\) is \(\alpha \)-labeled, \(H\) is pseudograceful), \(G+\overline K_n\) (\(G\) is a Skolem-graceful graph), \(\overline K_n+mK_2\) and \(C_m\cup S_n\) (\(S_n\) is a star on \(n+1\) vertices) are discussed.
openaire +2 more sources
Gracefulness of the join of graceful graph and path
AIP Conference Proceedings, 2023Luthfan Fawwaz +3 more
openaire +1 more source
Graceful graphs with pendant edges
Australas. J Comb., 2005The author gives graceful labelings for the graphs \(G+ nK\), and \(G\odot nK\), where \(G\) is a graceful graph whose order is greater than its size. He also provides a graceful labeling for the unicyclic graph formed when an arbitrary number of pendant edges are attached to a cycle.
openaire +2 more sources
Evolving labelings of graceful graphs
Proceedings of the Genetic and Evolutionary Computation Conference, 2022Luke Branson, Andrew M. Sutton
openaire +1 more source
On graceful and cordial labeling of shell graphs.
Ars Comb., 2011A graceful labeling, an \(\alpha \)-labeling (called here \(\Delta \)-labeling), and a cordial labeling of yet another special class of graphs are provided. Unfortunately, the paper contains many typographical, grammatical and stylistic errors.
G. Sethuraman 0001, K. Sankar
openaire +4 more sources
Two classes of graceful graphs
Ars Comb., 2000A graph is graceful if it allows a labelling \(\varphi \) of its vertices by distinct nonnegative integers such that, for edges \(uv\), \(|\varphi (u)-\varphi (v)|\) attains all values from \(\{1,2,\dots ,q\}\), where \(q\) is the number of edges. This paper identifies two new classes of graceful graphs.
openaire +2 more sources