Results 121 to 130 of about 2,422,838 (348)
Zhejiang Daxue xuebao. Lixue ban, 2016 Let f:E(G)→Z+ be an edge-weighting (labeing) of a graph G. For each v∈V(G) ， if yields a proper coloring of the graph, then f is defined as a neighbour-distinguishing edge labeling of G. Let g: V(G) ∪ E(G)→Z+ be a total-weighting (labeing) of a graph G.
LYUDamei(吕大梅) +1 more
doaj +1 more source
Colourings of graphs by labellings
Electronic Notes in Discrete Mathematics, 2017 Abstract In this paper we give a survey on several types of colourings of elements of graphs by different types of labellings.
Martin Bača, Stanislav Jendrol
openaire +1 more source
FEBS Open Bio, EarlyView.Cleavable N‐terminal Thioredoxin fusion enabled soluble expression and purification of otherwise insoluble SARS‐CoV‐2 Nucleocapsid (N) protein. A four‐step purification strategy yielded highly homogeneous, RNA‐free N protein. Binding assays showed high RNA affinity (Kd ~ 28 nm). The study will facilitate high‐resolution structural studies of N protein,
Shweta Singh, Gagan D. Gupta
wiley +1 more source
Advanced Biology, EarlyView.The axolotl's remarkable regenerative abilities decline with age, the causes may include the numerous repetitive elements within its genome. This study uncovers how Ty3 retrotransposons and coexpression networks involving muscle and immune pathways respond to aging and regeneration, suggesting that transposons respond to physiological shifts and may ...
Samuel Ruiz‐Pérez +8 more
wiley +1 more source
Super -edge antimagic total labeling of a subclass of trees
AKCE International Journal of Graphs and Combinatorics, 2017 A graph labeling is a mapping that assigns numbers to graph elements. The domain can be the set of all vertices, the set of all edges or the set of all vertices and edges.
M. Javaid, A.A. Bhatti, M.K. Aslam
doaj +1 more source
The Odd Harmonious Labeling on Variation of the Double Quadrilateral Windmill Graphs
Jurnal Ilmu Dasar, 2017 A Graphis calledif it hasvertices and edqes. The graphis said to be an odd harmonious if there exists an injectionsuch that induced mappingis a bijection and is said to be an odd harmonious labeling of.
Fery Firmansah
doaj +1 more source
Informative labeling schemes for graphs
Theoretical Computer Science, 2000 AbstractThis paper introduces the notion of informative labeling schemes for arbitrary graphs. Let f(W) be a function on subsets of vertices W. An f labeling scheme labels the vertices of a weighted graph G in such a way that f(W) can be inferred (or at least approximated) efficiently for any vertex subset W of G by merely inspecting the labels of the ...
openaire +1 more source
RhoA and Rac1 as Mechanotransduction Mediators in Colorectal Cancer
Advanced Biology, EarlyView.Analysing RhoA and Rac1 protein levels in Colorectal cancer (CRC) samples under mechanical strain highlights their potential as diagnostic markers. Monitoring their activity could offer valuable insights into how cancer spreads, paving the way for new approaches to better understand and diagnose colorectal cancer.
Sharda Yadav +5 more
wiley +1 more source
Advanced Biology, EarlyView.In this study, a new type of bioactive glass fiber ‐based composite magnesium phosphate bone cement is prepared and verified that its mechanical strength and biological properties. In addition, the cement may have played a biologically active role in the Notch and HIF signaling pathways.
Yuzheng Lu +12 more
wiley +1 more source
On Total H-Irregularity Strength of the Disjoint Union of Graphs
Discussiones Mathematicae Graph Theory, 2020 A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha +5 more
doaj +1 more source