Results 21 to 30 of about 2,513 (245)
Let G be a graph with p vertices and q edges and be an injective function, where k is a positive integer. If the induced edge labeling defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G.
M. Uma Devi, M. Kamaraj, S. Arockiaraj
doaj +1 more source
Graceful labeling on torch graph
Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}.
Jona Martinus Manulang, Kiki A. Sugeng
doaj +1 more source
A Study on C-Exponential Mean Labeling of Graphs
A function h is mentioned as a C-exponential mean labeling of a graph GV,E that has s vertices and r edges if h:VG⟶1,2,3,⋯,r+1 is injective and the generated function h∗:EG⟶2,3,4,⋯,r+1 defined by h∗ab=1/ehbhb/haha1/hb−ha, for all ab∈EG, is bijective.
Thamaraiselvi Baskaran +1 more
doaj +1 more source
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
Let r be any natural number. An injective function , where is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that is bijective.
K Sunitha, M Sheriba
doaj +1 more source
Topological Integer Additive Set-Sequential Graphs
Let \(\mathbb{N}_0\) denote the set of all non-negative integers and \(X\) be any non-empty subset of \(\mathbb{N}_0\). Denote the power set of \(X\) by \(\mathcal{P}(X)\). An integer additive set-labeling (IASL) of a graph \(G\) is an injective function
Sudev Naduvath +2 more
doaj +1 more source
Square Sum And Square Difference Labelings Of Semitotal-block Graph For Some Class Of Graphs
A graph G is said to be square sum and square difference labeling, if there exists a bijection f from V (G) to {1, 2, 3, ..., (p − 1)} which induces the injective function f ∗ from E(G) to N, defined by f ∗(uv) = f(u)2 + f(v)2 and f ∗(uv) = f(u)2 − f(v)2
Keerthi G. Mirajkar +1 more
doaj +1 more source
PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN L_n (q,r)
Graph labelling is a function that maps graph elements to positive integers. A covering of graph is family subgraph from , for with integer k. Graph admits covering if for every subgraph is isomorphic to a graph .
TIRA CATUR ROSALIA +2 more
doaj +1 more source
Organoids in pediatric cancer research
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
A Cre‐dependent lentiviral vector for neuron subtype‐specific expression of large proteins
We designed a versatile and modular lentivector comprising a Cre‐dependent switch and self‐cleaving 2A peptide and tested it for co‐expression of GFP and a 2.8 kb gene of interest (GOI) in mouse cortical parvalbumin (PV+) interneurons and midbrain dopamine (TH+) neurons.
Weixuan Xue +6 more
wiley +1 more source
By dawn or dusk—how circadian timing rewrites bacterial infection outcomes
The circadian clock shapes immune function, yet its influence on infection outcomes is only beginning to be understood. This review highlights how circadian timing alters host responses to the bacterial pathogens Salmonella enterica, Listeria monocytogenes, and Streptococcus pneumoniae revealing that the effectiveness of immune defense depends not only
Devons Mo +2 more
wiley +1 more source

