Results 41 to 50 of about 34,731 (238)
The reflexive edge strength on some almost regular graphs
A function f with domain and range are respectively the edge set of graph G and natural number up to ke, and a function f with domain and range are respectively the vertex set of graph G and the even natural number up to 2kv are called a total k-labeling
Ika Hesti Agustin +4 more
doaj +1 more source
Further results on edge irregularity strength of graphs
A vertex $k$-labelling $\phi:V(G)\longrightarrow \{1,2,\ldots,k\}$ is called irregular $k$-labeling of the graph $G$ if for every two different edges $e$ and $f$, there is $w_{\phi}(e)\neq w_{\phi}(f)$; where the weight of an edge is given by $e=xy\in E ...
Muhammad Imran +3 more
doaj +1 more source
On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs
For a simple graph G with a vertex set VG and an edge set EG, a labeling f:VG∪EG⟶1,2,⋯,k is called a vertex irregular total k−labeling of G if for any two different vertices x and y in VG we have wtx≠wty where wtx=fx+∑u∈VGfxu.
Nurdin Hinding +3 more
doaj +1 more source
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova +25 more
wiley +1 more source
Clustering Algorithm Reveals Dopamine‐Motor Mismatch in Cognitively Preserved Parkinson's Disease
ABSTRACT Objective To explore the relationship between dopaminergic denervation and motor impairment in two de novo Parkinson's disease (PD) cohorts. Methods n = 249 PD patients from Parkinson's Progression Markers Initiative (PPMI) and n = 84 from an external clinical cohort.
Rachele Malito +14 more
wiley +1 more source
Total Edge Fibonacci-Like Sequence Irregular Labeling
In this paper, we are introducing total edge Fibonacci-like sequence irregular labeling. A total edge Fibonacci-like sequence irregular labeling f : V (G) S E(G) → {1, 2, . . . ,K} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x 0 y 0 their weights f( x ) + f( xy ) + f( y ) and f( x 0 )
S. Navanaeethakrishnan +2 more
openaire +1 more source
Edge irregular reflexive labeling of some tree graphs
Abstract Let G be a connected, simple, and undirected graph with a vertex set V(G) and an edge set E(G). Total k-labeling is a function fe from the edge set to the first ke natural number, and a function fv from the vertex set to the non negative even number up to 2kv, where k ...
Ika Hesti Agustin +3 more
openaire +1 more source
Developmental and Epileptic Encephalopathy due to Biallelic Pathogenic Variants in PIGM
ABSTRACT Objective PIGM encodes a critical enzyme in the glycosylphosphatidylinositol (GPI)‐anchor biosynthesis pathway. While promoter‐region mutations in PIGM have been associated with a relatively mild phenotype characterized by portal vein thrombosis and absence seizures, recent evidence suggests that coding‐region mutations result in a more severe
Júlia Sala‐Coromina +11 more
wiley +1 more source
The total face irregularity strength of some plane graphs
A face irregular total -labeling of a 2-connected plane graph is a labeling of vertices and edges such that their face-weights are pairwise distinct. The weight of a face under a labeling is the sum of the labels of all vertices and edges surrounding ...
Meilin I. Tilukay +3 more
doaj +1 more source
LOCAL IRREGULARITY POINT COLORING ON THE RESULT OF SUBDIVISION OPERATION OF HELM GRAPHS
One of the sub-chapters studied in graphs is local irregularity vertex coloring of graph. The based on definition of local irregularity vertex coloring of graph, as follow : (i)l : V (G) →{1, 2, 3, . . . , k} as a vertex irregular labeling and w : V (G) →
Ilmiatun Nuroeni +4 more
doaj +1 more source

