Zobrazeno 1 - 10
of 174
pro vyhledávání: '"Hamamache Kheddouci"'
Autor:
Hamamache Kheddouci, Olivier Togni
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 10 no. 1, Iss Graph and Algorithms (2008)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/9c0efff5fdec420cb6b795a0d72be198
Autor:
Hamamache Kheddouci, Olivier Togni
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 10, Iss 1 (2008)
For a set D⊂ Z n, the distance graph P n (D) has Z n as its vertex set and the edges are between vertices i and j with |i-j|∈D. The circulant graph C n (D) is defined analogously by considering operations modulo n. The minimum feedback vertex set
Externí odkaz:
https://doaj.org/article/9ef95d0db0114c668079f7053b3100c5
Autor:
Brice Effantin, Hamamache Kheddouci
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 6, Iss 1 (2003)
The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x i adjacent to a v
Externí odkaz:
https://doaj.org/article/136cff6df6344265af159a8227ea1229
Publikováno v:
Journal of Supercomputing
Journal of Supercomputing, 2023, 79 (5), pp.4791-4819. ⟨10.1007/s11227-022-04835-3⟩
Journal of Supercomputing, 2023, 79 (5), pp.4791-4819. ⟨10.1007/s11227-022-04835-3⟩
International audience; Circuits in a graph are interesting structures and identifying them is of an important relevance for many applications. However, enumerating circuits is known to be a difficult problem, since their number can grow exponentiall
Publikováno v:
Discrete Mathematics, Algorithms and Applications.
Graph protection using mobile guards has received a lot of attention in the literature. It has been considered in different forms, including Eternal Dominating set, Eternal Independent set and Eternal Vertex Cover set. In this paper, we introduce and
Publikováno v:
Cluster Computing.
Publikováno v:
Communications in Computer and Information Science ISBN: 9783031340192
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1cf1fed383da50022c6aef54a9b73944
https://doi.org/10.1007/978-3-031-34020-8_27
https://doi.org/10.1007/978-3-031-34020-8_27
Publikováno v:
Communications in Computer and Information Science ISBN: 9783031340192
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9242f4d769f5519079d74fbd8b573635
https://doi.org/10.1007/978-3-031-34020-8_32
https://doi.org/10.1007/978-3-031-34020-8_32
Autor:
Mohammed Lalou, Hamamache Kheddouci
Publikováno v:
Computers & Operations Research. :106281
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 52:558-570
A graph H of order n is said to be $$k-placeable$$ into a graph G, having the same order n, if G contains k edge-disjoint copies of H. Kaneko et al. [9] proved that any non-star tree T is $$2-placeable$$ into its third power $$T^3$$ . In this paper,