Results 201 to 210 of about 597 (229)

Arrhythmia detection by the graph convolution network and a proposed structure for communication between cardiac leads. [PDF]

BMC Med Res Methodol
Andayeshgar B, Abdali-Mohammadi F, Sepahvand M, Almasi A, Salari N.   +4 more
europepmc   +1 more source

Gadolinium-Doped Hydroxyapatite Nanoparticles Functionalized with Curcumin and Folic Acid: Structural Insights and Magnetic Behavior for Theranostic Applications. [PDF]

Materials (Basel)
Marinho JPN, Vieira LAF, Oliveira AF, Garcia AM, Guarin MEB, Barbosa JBS, Ladeira YFX, Silva AHM, de Sousa EMB.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Total vertex irregularity strength of generalized prism graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2021
A total k-labeling φ : V ∪ E → {1, 2, 3,…, k} is called a vertex irregular total k-labeling, if wt(a) ≠ wt(b), for x ≠ y ∈V, The weight of a vertex is defined as: , where N(a) is the set of neighbo...
Muhammad Imran, Ali Ahmad, Muhammad Kamran Siddiqui, Tariq Mehmood   +3 more
openaire   +1 more source

Total Vertex Irregularity Strength of Dense Graphs

Journal of Graph Theory, 2013
AbstractConsider a graph of minimum degree δ and order n. Its total vertex irregularity strength is the smallest integer k for which one can find a weighting such that for every pair of vertices of G. We prove that the total vertex irregularity strength of graphs with is bounded from above by .
Majerski, P., Przybyło, J.
openaire   +2 more sources

Total Vertex Irregularity Strength of 1-Fault Tolerant Hamiltonian Graphs

Mathematics in Computer Science, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rajasingh, Indra, Annamma, V.
openaire   +1 more source

Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs

SIAM Journal on Discrete Mathematics, 2009
Let $G$ be a simple graph of order $n$ with no isolated edges and at most one isolated vertex. For a positive integer $w$, a $w$-weighting of $G$ is a function $f:E(G)\rightarrow\{1,2,\dots,w\}$. An irregularity strength of $G$, $s(G)$, is the smallest $w$ such that there is a $w$-weighting of $G$ for which $\sum_{e:u\in e}f(e)\neq\sum_{e:v\in e}f(e ...
openaire   +1 more source

On total vertex irregularity strength of generalized uniform cactus chain graphs with pendant vertices

Journal of Discrete Mathematical Sciences and Cryptography, 2020
In this research, we use the concept of a vertex irregular total k labeling and tvs(G). Specifically, we investigate tvs of generalized uniform cactus chain graphs with (n – 2)r pendant vertices an...
Isnaini Rosyida, null Mulyono, Diari Indriati   +2 more
openaire   +1 more source

Total vertex irregularity strength of corona product of some graphs

2016
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular
Jeyanthi, P., Sudha, A.
openaire   +1 more source

The total vertex irregularity strength for cubic graphs with a perfect matching

Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleams Barra, Muhammad Afifurrahman
openaire   +2 more sources

Cancer Statistics, 2021

Ca-A Cancer Journal for Clinicians, 2021
Rebecca L Siegel, Kimberly D Miller
exaly