Zobrazeno 1 - 10
of 126
pro vyhledávání: '"Kazem Khashyarmanesh"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-12 (2024)
A subset S of vertices of a graph G is a determining set for G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph G is the smallest integer r such that G has a determining set of size r. In this pa
Externí odkaz:
https://doaj.org/article/719e18112c294135aa67ec3d9b3bea21
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 1, Pp 63-70 (2024)
AbstractIn this paper, we investigate the distinguishing chromatic number of Kronecker product of paths, cycles, star graphs, symmetric trees, almost symmetric trees, and bisymmetric trees.
Externí odkaz:
https://doaj.org/article/825b3905a095406393e80f2abfae40f4
Publikováno v:
Discrete Mathematics Letters, Vol 11, Pp 38-45 (2022)
Externí odkaz:
https://doaj.org/article/82b9cab5d06f4c43bed57b14f1279638
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 2, Pp 118-124 (2022)
In this paper, we investigate the metric dimension, local metric dimension and edge metric dimension for some (generalized) Cayley graphs.
Externí odkaz:
https://doaj.org/article/ab3eced787ef48b498fa0e0f0d78ec51
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
Let G be a connected graph. A subset S of vertices of G is said to be a resolving set of G, if for any two vertices u and v of G there is at least a member w of S such that du,w≠dv,w. The minimum number t that any subset S of vertices G with S=t is
Externí odkaz:
https://doaj.org/article/61fb12aee746449580fce5b4e5f14de5
Publikováno v:
Communications in Algebra. :1-14
Publikováno v:
Journal of Algebra and Its Applications.
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 45:2865-2883
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing.
Publikováno v:
Journal of Algebra Combinatorics Discrete Structures and Applications. :55-68