Results 11 to 20 of about 634,676 (271)
Distinguishing number and distinguishing index of some operations on graphs
Journal of Information and Optimization Sciences, 2018 11 pages, 4 ...
Alikhani, Saeid, Soltani, Samaneh
openaire +4 more sources
Neighbor sum distinguishing index of planar graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Guanghui +2 more
openaire +4 more sources
Evaluation of netrin 1 as a new biomarker in the differentiation of psoriatic arthritis from psoriasis [PDF]
Scientific ReportsThis study aimed to evaluate the utility of netrin 1, CRP (C-reactive protein), and ESR (erythrocyte sedimentation rate) biomarkers for distinguishing between psoriatic arthritis (PsA) and psoriasis.
Ahmet Kor +6 more
doaj +2 more sources
The Distinguishing Numbers and the Distinguishing Indexes of Cayley Graphs
Journal of Applied and Industrial Mathematics, 2021 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. In this paper, we investigate the distinguishing number and the distinguishing index of Cayley graphs.
Alikhani, S., Soltani, S.
openaire +3 more sources
Distinguishing number and distinguishing index of certain graphs [PDF]
Filomat, 2017 The distinguishing number (index) D(G) (D0(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. In this paper we compute these two parameters for some specific graphs.
Alikhani, Saeid, Soltani, Samaneh
openaire +3 more sources
The Distinguishing Index of Infinite Graphs [PDF]
The Electronic Journal of Combinatorics, 2015 The distinguishing index $D^\prime(G)$ of a graph $G$ is the least cardinal $d$ such that $G$ has an edge colouring with $d$ colours that is only preserved by the trivial automorphism. This is similar to the notion of the distinguishing number $D(G)$ of a graph $G$, which is defined with respect to vertex colourings.We derive several bounds for ...
Broere, Izak, Pilsniak, Monika
openaire +2 more sources
Edge-Distinguishing Index of a Graph [PDF]
Graphs and Combinatorics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kalinowski, Rafał, Woźniak, Mariusz
openaire +1 more source
Two-distance vertex-distinguishing index of sparse graphs
Open Mathematics, 2023 The two-distance vertex-distinguishing index χd2′(G){\chi }_{d2}^{^{\prime} }\left(G) of graph GG is defined as the smallest integer kk, for which the edges of GG can be properly colored using kk colors.
He Zhengyue, Liang Li, Gao Wei
doaj +1 more source
European Journal of Combinatorics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monika Pilśniak, Thomas Tucker
openaire +2 more sources
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source