Results 51 to 60 of about 307 (247)
Towards the Graceful Tree Conjecture: A Survey [PDF]
, 2008 A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2,..., n} such that the induced edge labels are all distinct.
Helen Giggins +2 more
core
Graceful signed graphs: II. The case of signed cycles with connected negative sections [PDF]
, 2005 summary:In our earlier paper [9], generalizing the well known notion of graceful graphs, a $(p,m,n)$-signed graph $S$ of order $p$, with $m$ positive edges and $n$ negative edges, is called graceful if there exists an injective function $f$ that ...
Milton J. Rosenberg +3 more
core +1 more source
A note on the number of graceful labellings of paths
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert E. L. Aldred +2 more
openaire +2 more sources
Advanced Science, EarlyView.RNA structural profiling of Turnip Yellow Mosaic Virus by DMS‐MaPseq and DREEM analyses uncover that viral genome‐wide RSS is highly complicated and heterogeneous, with alternative RSSs widely distributed across the genome. Notably, the viral 3’ tRNA‐like structure adopts alternative conformations in vivo.
Jiaying Zhu +7 more
wiley +1 more source
Desain dan Analisis Algoritma Local Search Dengan Metode Hill Climbing pada Permasalahan Graceful Labelling Pada General Tree [PDF]
, 2019 Graceful labelling dari suatu graf G dengan N node adalah injeksi f : V (G) -> 0, 1, 2, ... ,N - 1 sehingga ketika setiap edge xy ϵ E(G) diberi label |f(x) - f(y)| maka semua label pada edge berbeda.
Dembo, William Albertus
core
PlantGFM: A Genomic Foundation Model for Discovery and Creation of Plant Genes
Advanced Science, EarlyView.A plant genomic foundation model pre‐trained on 12 species enables both accurate gene prediction and de novo gene design. Through AI‐human knowledge screening, seven designed sequences showed transcriptional activity in plants, with two expressing stable proteins—demonstrating the first DNA‐RNA‐protein expression of LLM‐generated genes in plants and ...
Changhao Li +10 more
wiley +1 more source
ON k-GRACEFUL LABELING OF SOME GRAPHS
Journal of applied mathematics & informatics, 2016 Summary: In this paper, it has been shown that the hairy cycle \(C_{n}\odot rK_{1},\) \(n\equiv 3\pmod 4\), the graph obtained by adding pendant edge to each pendant vertex of hairy cycle \(C_{n}\odot 1K_{1}\), \(n\equiv 0\pmod 4\), double graph of path \(P_{n}\) and double graph of comb \(P_{n}\odot 1K_{1}\) are \(k\)-graceful.
Pradhan, P., Kumar, Kamesh
openaire +3 more sources
Advanced Science, EarlyView.This study reveals a metabolic signaling axis in the OSCC microenvironment where palmitic acid (PA) drives the activation of CAFs. PA uptake triggers CEBPG‐dependent epigenetic remodeling to upregulate ERN1 and TMBIM6, thereby mitigating ER stress. This adaptive program sustains CAF survival and the pro‐metastatic phenotype, establishing this pathway ...
Yiling Duan +6 more
wiley +1 more source
On the graceful conjecture for triangular cacti [PDF]
, 2012 A graceful labelling of a graph with n edges is a vertex labelling where the induced set of edge weights is {1, . . . , n}. A near graceful labelling is almost the same, the difference being that the edge weights are {1, 2, . . . , n − 1, n + 1}. In both
Brenda Wicks +3 more
core
An Adiabatic Quantum Algorithm for Determining Gracefulness of a Graph [PDF]
, 2017 Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph G with e edges, is to label the vertices of G with 0, 1, ℒ, e such that, if we specify to each edge the difference value between its two ends,
Shahrooz Janbaz +3 more
core +1 more source