Zobrazeno 1 - 10
of 188
pro vyhledávání: '"distinguishing index"'
Publikováno v:
Open Mathematics, Vol 21, Iss 1, Pp 113771-3010 (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. In this way, any pair of vertices at distan
Externí odkaz:
https://doaj.org/article/1be2ed8854874812a8f8773c6285be74
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Saeid Alikhani, Samaneh Soltani
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 1, Pp 77-85 (2021)
The distinguishing index D'(G) of a graph G is the least integer d such that G has an edge labeling with d labels that is preserved only by a trivial automorphism. The Kronecker product G x H of two graphs G and H is the graph with vertex set V(G) x
Externí odkaz:
https://doaj.org/article/a5f4d263b3d0485896f530ad03615474
Autor:
Baudon Olivier, Hocquard Hervé, Marczyk Antoni, Pilśniak Monika, Przybyło Jakub, Woźniak Mariusz
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 4, Pp 1175-1186 (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. In this paper, we foc
Externí odkaz:
https://doaj.org/article/78d65607858d4c3ea2b34a04a1b5f587
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 875-884 (2020)
The distinguishing number (index) D(G) (D′ (G)) of a graph G is the least integer d such that G has an vertex (edge) labeling with d labels that is preserved only by the trivial automorphism. It is known that for every graph G we have D′ (G) ≤
Externí odkaz:
https://doaj.org/article/89de7e86ea3f40d49c99535268227aa4
Autor:
Saeid Alikhani, Samaneh Soltani
Publikováno v:
پژوهشهای ریاضی, Vol 6, Iss 1, Pp 109-118 (2020)
Introduction The graph is a mathematical model for a discrete set whose members are interlinked in some way. The members of this collection can be the different parts of the earth and the connections between them are bridges that tie them together (l
Externí odkaz:
https://doaj.org/article/90a6645985654b0c988c3d9bf1cdcf9f
Autor:
Vučković Bojan
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 323-329 (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)
Externí odkaz:
https://doaj.org/article/020bcd8a0c1a4371ac6c8b83cb857deb
Autor:
Saeid Alikhani, Samaneh Soltani
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 1-6 (2020)
The distinguishing number (index) () of a graph is the least integer such that has a vertex labeling (edge labeling) with labels that is preserved only by a trivial automorphism. A graphoidal cover of is a collection of (not necessarily open) paths i
Externí odkaz:
https://doaj.org/article/c26414fc953d450a98cc6b83c58c7a5e
Autor:
Saeid Alikhani, Samaneh Soltani
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 131-138 (2020)
The distinguishing index of a graph , denoted by , is the least number of labels in an edge coloring of not preserved by any non-trivial automorphism. The distinguishing chromatic index of a graph is the least number such that has a proper edge color
Externí odkaz:
https://doaj.org/article/eef679c397ca4a91a8622b64652a2e04
Autor:
Saeid Alikhani, Samaneh Soltani
Publikováno v:
Mathematics Interdisciplinary Research, Vol 4, Iss 2, Pp 239-251 (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. In this paper we study the distinguishing number and
Externí odkaz:
https://doaj.org/article/66886be0fde64fad9c0d8f33486f5511