Results 21 to 30 of about 634,676 (271)

Serum Ratio of Free Triiodothyronine to Thyroid-Stimulating Hormone: A Novel Index for Distinguishing Graves’ Disease From Autoimmune Thyroiditis

open access: yesFrontiers in Endocrinology, 2021
ObjectiveGraves’ disease (GD) and autoimmune thyroiditis (AIT) are two major causes of thyrotoxicosis that require correct diagnosis to plan appropriate treatment. The objectives of this study were to evaluate the usefulness of thyroid-related parameters
Zhiyong Wu   +11 more
doaj   +1 more source

List distinguishing index of graphs

open access: yes, 2023
We say that an edge colouring breaks an automorphism if some edge is mapped to an edge of a different colour. We say that the colouring is distinguishing if it breaks every non-identity automorphism. We show that such colouring can be chosen from any set of lists associated to the edges of a graph G, whenever the size of each list is at least $Δ-1 ...
Kwaśny, Jakub, Stawiski, Marcin
openaire   +2 more sources

Color-blind index in graphs of very low degree [PDF]

open access: yes, 2015
Let $c:E(G)\to [k]$ be an edge-coloring of a graph $G$, not necessarily proper. For each vertex $v$, let $\bar{c}(v)=(a_1,\ldots,a_k)$, where $a_i$ is the number of edges incident to $v$ with color $i$.
Achlioptas   +13 more
core   +3 more sources

Measuring religious social capital: the scale properties of the Williams Religious Social Capital Index (WRSCI) among cathedral congregations [PDF]

open access: yes, 2008
The theoretical construct of social capital remains contested in terms of conceptualisation and measurement. The present paper follows the convention of distinguishing between trust, bonding, bridging and linking social capital, to conceptualise how ...
Williams, Emyr
core   +1 more source

On a Total Version of 1-2-3 Conjecture

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1, . . . , k}. These colors can be used to distinguish adjacent vertices of G. There are many possibilities of such a distinction.
Baudon Olivier   +5 more
doaj   +1 more source

Rectangular Cavity Sensor for Distinguishing Between Normal and High-Drivability-Index Gasolines

open access: yesIEEE Access, 2020
The Drivability Index (DI) of gasoline is a measure of fuel performance of engine operations. Therefore, distinguishing a gasoline of specific DI in advance is useful for improving engine efficiency and maintenance.
Chong Hyun Lee   +2 more
doaj   +1 more source

An Improved Upper Bound on Neighbor Expanded Sum Distinguishing Index

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A total k-weighting f of a graph G is an assignment of integers from the set {1, . . . , k} to the vertices and edges of G. We say that f is neighbor expanded sum distinguishing, or NESD for short, if Σw∈N(v) (f(vw) + f(w)) differs from Σw∈N(u)(f(uw) + f(
Vučković Bojan
doaj   +1 more source

Social capital and immigrants' labour market performance [PDF]

open access: yes, 2016
This paper analyses the role of social capital on immigrants’ labour market outcomes. We use the “principal component analysis” (PCA) to build an index of social networks and explore its impact on the probability of getting a job and on wage levels ...
Piracha, Matloob   +2 more
core   +1 more source

The distinguishing number and the distinguishing index of co-normal product of two graphs

open access: yesRatio Mathematica, 2019
The distinguishing number (index) $D(G)$ ($D'(G)$)  of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling)  with $d$ labels  that is preserved only by a trivial automorphism.
Saeid Alikhani, Samaneh Soltani
doaj   +1 more source

Distinguishing number and distinguishing index of neighbourhood corona of two graphs

open access: yesContributions to Discrete Mathematics, 2019
The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling)  with $d$ labels  that is preserved only by a trivial automorphism. The neighbourhood corona of two graphs $G_1$ and $G_2$ is denoted by  $G_1 \star G_2$  and is the graph obtained by     taking one copy of ...
Alikhani, Saeid, Soltani, Samaneh
openaire   +3 more sources

Home - About - Disclaimer - Privacy