>
Fa
|
Ar
|
En
transactions on combinatorics
سال:2025 - دوره:14 - شماره:2
[13] m. g. karpovsky, k. chakrabarty and l. b. levitin, on a new class of codes for identifying vertices ingraphs, ieee trans. inform. theory, 44 no. 2 (1998) 599–611.[14] m. murtaza, i. javaid and m. fazil, covering codes of a graph associated with a finite vector space,ukrainian math. j., 72 no. 7 (2020) 1108–1117.[15] j. moncel, on graphs on n vertices having an identifying code of cardinality ⌈log2(n + 1)⌉, discrete appl.math., 154 no. 14 (2006) 2032–2039.[16] r. nikandish, h. r. maimani and h. izanloo, the annihilating-ideal graph of zn is weakly perfect, contrib.discrete math., 11 no. 1 (2016) 16–21.[17] d. b. west, introduction to graph theory, prentice hall, inc., upper saddle river, nj, 1996.[18] h. y. yu and t. wu, commutative rings r whose c(ag(r)) consist of only triangles, comm. algebra, 43no. 3 (2015) 1076–1097.
- صفحه:89-96
commutative rings introduce a class of identifiable graphs
- صفحه:79-88
forbidden subgraphs of co-prime graphs of finite groups
- صفحه:109-116
on the indices of certain graph products
- صفحه:117-134
some properties of the generalized sierpiński gasket graphs
- صفحه:97-108
Copyright 2023
Islamic World Science Citation Center
All Rights Reserved
