Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Najat Muthana"'
Publikováno v:
Mathematics, Vol 12, Iss 13, p 2126 (2024)
This paper introduces equitable graphs of Type I associated with finite groups. We investigate the connectedness and some graph-theoretic properties of these graphs for various groups. Furthermore, we establish the novel concepts of the equitable squ
Externí odkaz:
https://doaj.org/article/75aaa04b6afe4943881bf42418993fcc
Publikováno v:
International Journal of Analysis and Applications, Vol 18, Iss 6, Pp 1108-1122 (2020)
For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors). In this research work, we introduce a new type of graph coloring called mono
Externí odkaz:
https://doaj.org/article/d63d8ad17b264c90b43e6081c9563b5b
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
One of the most important branches of mathematics is algebraic graph theory, which solves graph problems with algebraic methods. In graph theory, several algebraic properties of a ring can be represented. In this paper, we define an innovative graph
Externí odkaz:
https://doaj.org/article/291bb626d2de44e1b6f600549805c605
Publikováno v:
International Journal of Analysis and Applications, Vol 20, Pp 6-6 (2022)
One of the tools, to research and investigation the structural dependence of various properties and some activities of chemical structures and networks is the topological indices of graphs. In this research work, we introduce novel indices of graphs
Externí odkaz:
https://doaj.org/article/10528b417c7c4eaab6dc2eee8e0f3b80
Publikováno v:
Advances and Applications in Discrete Mathematics. 26:109-131
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf6850336f3585e9e54f6bc6ab0aefe7
https://doi.org/10.17654/dm026020109
https://doi.org/10.17654/dm026020109
Publikováno v:
Journal of Applied Mathematics and Physics. :1168-1179
A path π = [v1, v2, …, vk] in a graph G = (V, E) is an uphill path if deg(vi) ≤ deg(vi+1) for every 1 ≤ i ≤ k. A subset S ⊆ V(G) is an uphill dominating set if every vertex vi ∈ V(G) lies on an uphill path originating from some vertex in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8884ddfb3c5d4506137d9c55dc62f9b
https://doi.org/10.4236/jamp.2020.86088
https://doi.org/10.4236/jamp.2020.86088
Publikováno v:
Mathematica Slovaca. 69:1023-1032
Our purpose in this paper is to investigate some particular classes of generalized derivations and their relationship with commutativity of prime rings with involution. Some well-known results characterizing commutativity of prime rings have been gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::baeb5ac30058f45e3643a0a1b7c82384
https://doi.org/10.1515/ms-2017-0286
https://doi.org/10.1515/ms-2017-0286
Publikováno v:
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, Springer, In press, ⟨10.1007/s12095-021-00499-7⟩
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, In press, ⟨10.1007/s12095-021-00499-7⟩
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, Springer, In press, ⟨10.1007/s12095-021-00499-7⟩
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, In press, ⟨10.1007/s12095-021-00499-7⟩
International audience; We present two new constructions of entanglement-assisted quantum error-correcting codes using some fundamental properties of (classical) linear codes in an effective way. The main ideas include linear complementary dual codes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4508ff2c681007928f5514d865d0e7e1
https://hal.archives-ouvertes.fr/hal-03339152
https://hal.archives-ouvertes.fr/hal-03339152
Publikováno v:
Applied Mathematics. :264-273
For any graph G, the Inj-equitable graph of a graph G, denoted by IE (G) , is the graph with the same vertices as G and for any two adjacent vertices u and v in IE (G), ≤ 1, where for any vertex w∈V (G) , degin (w) = . In this paper, Inj-equitabl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9a79a149afb398f35bd511ed7a30a63
https://doi.org/10.4236/am.2018.93020
https://doi.org/10.4236/am.2018.93020
Publikováno v:
Cryptography and Communications. 14:39-39
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e8c13880a1f727de96aa9f2eba08f03
https://doi.org/10.1007/s12095-021-00532-9
https://doi.org/10.1007/s12095-021-00532-9