Zobrazeno 1 - 10
of 65
pro vyhledávání: '"E. Mwambene"'
Autor:
O. Habineza, E. Mwambene
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 3, Pp 308-312 (2023)
AbstractIn this paper, we consider the automorphism groups of Cayley graphs which are a basis of a complete Boolean algebra of strongly regular graphs, one of such graph is the integral distance graph [Formula: see text] The automorphism groups of th
Externí odkaz:
https://doaj.org/article/bfc6bf31fd094a938595c55bedd09b02
Autor:
N.B. Mumba, E. Mwambene
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 1, Pp 27-30 (2018)
Hofmeister considered the automorphism groups of antipodal graphs through the exploration of graph covers. In this note we extend the exploration of automorphism groups of distance preserving graph covers. We apply the technique of graph covers to de
Externí odkaz:
https://doaj.org/article/6d6afc270d6b4450ac63c77b981af59a
Autor:
Imran Allie, E. Mwambene
Publikováno v:
Graphs and Combinatorics. 35:1433-1446
In this paper, we define meta-Cayley graphs on dihedral groups. We fully determine the automorphism groups of the constructed graphs in question. Further, we prove that some of the graphs that we have constructed do not admit subgroups which act regu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d2306ba0bfc3e9a285aaef7f5d4f614
https://doi.org/10.1007/s00373-019-02097-0
https://doi.org/10.1007/s00373-019-02097-0
Publikováno v:
Journal of Applied Mathematics and Computing. 61:461-479
Codes from adjacency matrices from the Hamming graphs $$H^k(n,m)$$ are examined for the property of being special LCD codes. The special property involves being able to propose a feasible decoding algorithm for the binary codes, and also to deduce th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e325d0e9e5f3a019e01e4108d06878e7
https://doi.org/10.1007/s12190-019-01259-w
https://doi.org/10.1007/s12190-019-01259-w
Publikováno v:
Quaestiones Mathematicae. 43:523-538
For a set Ω = {1, 2, . . . , n} where n = 2k ≥ 6, let Ω{k} denote the set of all subsets of Ω of size k. We examine the binary codes from the row span of biadjacency matrices of bipartite graphs wi...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6feeccfba09b4364417bcb4ad5e3e500
https://doi.org/10.2989/16073606.2019.1580227
https://doi.org/10.2989/16073606.2019.1580227
Autor:
E. Mwambene, N. B. Mumba
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 1, Pp 27-30 (2018)
Hofmeister considered the automorphism groups of antipodal graphs through the exploration of graph covers. In this note we extend the exploration of automorphism groups of distance preserving graph covers. We apply the technique of graph covers to de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c42960c3dc1a16c921a9095c4733128
http://www.sciencedirect.com/science/article/pii/S0972860017300397
http://www.sciencedirect.com/science/article/pii/S0972860017300397
Publikováno v:
Afrika Matematika. 29:753-759
We exhibit PD-sets for the binary and non-binary codes generated by incidence matrices of triangular graphs $$T_n$$ where $$n\ge 5$$ .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::853596b36bd7dcaa944de6ef739c2075
https://doi.org/10.1007/s13370-018-0576-2
https://doi.org/10.1007/s13370-018-0576-2
Publikováno v:
Graphs and Combinatorics. 34:163-192
Studies of the p-ary codes from the adjacency matrices of uniform subset graphs $$\varGamma (n,k,r)$$ and their reflexive associates have shown that a particular family of codes defined on the subsets are intimately related to the codes from these gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ab186b7cfe1803334f76f74d79bad0e
https://doi.org/10.1007/s00373-017-1862-8
https://doi.org/10.1007/s00373-017-1862-8
Publikováno v:
Graphs and Combinatorics. 33:357-368
Let $$k \ge 3$$k?3 be an integer and $$\Omega $$Ω a set of size $$2k+1.$$2k+1. We examine the binary codes generated by the row span of biadjacency matrices of the bipartite graphs $$\Gamma (2k+1,k,k+2,1).$$Γ(2k+1,k,k+2,1). Adjacency in these graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da681e440b7c178e103cf6d123501854
https://doi.org/10.1007/s00373-017-1765-8
https://doi.org/10.1007/s00373-017-1765-8
Publikováno v:
Advances in Mathematics of Communications. 9:211-232
We examine the binary codes $C_2(A_i+I)$ from matrices $A_i+I$ where $A_i$ is an adjacency matrix of a uniform subset graph $\Gamma(n,3,i)$ of $3$-subsets of a set of size $n$ with adjacency defined by subsets meeting in $i$ elements of $\Omega$, whe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfcb806b3f111683a8abd2c6b1d01fa2
https://doi.org/10.3934/amc.2015.9.211
https://doi.org/10.3934/amc.2015.9.211