Results 21 to 30 of about 307 (247)
Graceful labellings of new families of windmill and snake graphs [PDF]
, 2021 A function ƒ is a graceful labelling of a graph G = (V,E) with m edges if ƒ is an injection ƒ : V (G) → {0, 1, 2, . . . ,m} such that each edge uv ∈ E is assigned the label |ƒ(u) − ƒ(v)| ∈ {1, 2, . . . ,m}, and no two edge labels are the same.
Alkasasbeh, Ahmad
core +1 more source
Graceful Labeling of Hypertrees
Journal of Mathematics Research, 2021 Graph labeling is considered as one of the most interesting areas in graph theory. A labeling for a simple graph G (numbering or valuation), is an association of non -negative integers to vertices of G (vertex labeling) or to edges of G (edge labeling) or both of them.
H. El-Zohny +3 more
openaire +2 more sources
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
Graceful And Graceful Labeling Of Graphs
, 2018 {"references": ["1.\tJ. A. Gallian, A Dynamic survey of graph labeling, The electronic journal of combinatory 16 (2009).DS6. 2.\tI. Gutman, The energy of a graph, Ber. Math-satist. sekt. Forschungsz. Graz 103 (1978), 1-22. 3.\tGutman and B. Zhou, Laplacian energy of a graph, linear algebra appl. 414 (2006), 29-37. 4.\tI.
M. Soundharya, R. Balakumar
openaire +2 more sources
Improper Graceful and Odd-graceful Labellings of Graph Theory
CoRR, 2015 In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having ...
Hongyu Wang 0006, Jin Xu 0002, Bing Yao
openaire +2 more sources
Constraint Programming Models for Graceful Graphs [PDF]
, 2006 . The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the problem is presented, with several new results for graphs whose ...
Barbara M. Smith
core +1 more source
Towards the graceful tree conjecture [PDF]
, 2000 grantor: University of TorontoIn this thesis we present several results about graceful and near-graceful labellings of trees. Various modifications of the conditions for graceful and bipartite graceful labellings are probed; we conjecture that ...
Bussel, Frank Van
core +3 more sources
PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science
Advanced Engineering Materials, EarlyView.Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley +1 more source
Advanced Healthcare Materials, EarlyView.A biocompatible sodium alginate‐based hydrogel is developed as a next‐generation submucosal lifting agent intended for EMR and ESD. The optimized formulation exhibits a composition devoid of endotoxins, high viscosity, demonstrates reliable injectability, and ensures prolonged mucosal elevation.
Iram Maqsood +9 more
wiley +1 more source