Results 71 to 80 of about 2,525,419 (350)
1-Relaxed Edge-Sum Labeling Game [PDF]
, 2015 We introduce a new graph labeling and derive a game on graphs called the 1-relaxed modular edge-sum labeling game. Given a graph G and a natural number n, we define a labeling by assigning to each edge a number from {1,..., n} and assign a corresponding ...
Do, Hang, Moran, Brent, Singer, Timothy
core +1 more source
Electronic Notes in Discrete Mathematics, 2017 This paper contains part of a keynote talk at IWOGL 2016, Krakow, Poland, July 7-9 ...
openaire +3 more sources
The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity
FEBS Letters, EarlyView.The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley +1 more source
PAIR MEAN CORDIAL LABELING OF HURDLE, KEY, LOTUS, AND NECKLACE GRAPHS
BarekengLet be a graph with vertices and edges. Define and . Consider a mapping by assigning different labels in to the different elements of when is even and different labels in to elements of V and repeating a label for the remaining one ...
R Ponraj, S Prabhu
doaj +1 more source
Note on edge irregular reflexive labelings of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 For a graph , an edge labeling and a vertex labeling are called total -labeling, where . The total -labeling is called an edge irregular reflexive -labeling of the graph , if for every two different edges and of , one has The minimum for which the graph ...
Martin Bača +4 more
doaj +1 more source
On the Construction of the Reflexive Vertex k-Labeling of Any Graph with Pendant Vertex
International Journal of Mathematics and Mathematical Sciences, 2020 A total k-labeling is a function fe from the edge set to first natural number ke and a function fv from the vertex set to non negative even number up to 2kv, where k=maxke,2kv.
I. H. Agustin +4 more
doaj +1 more source
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source
Succinct Representation of Labeled Graphs [PDF]
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barbay, Jérémy +3 more
openaire +4 more sources
Molecular Oncology, EarlyView.In this exploratory study, we investigated the relationship between the gut microbiota and outcome in patients with metastatic hormone receptor‐positive breast cancer, treated in a randomized clinical trial with chemotherapy alone or chemotherapy in combination with immune checkpoint blockade.
Andreas Ullern +7 more
wiley +1 more source