#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2005

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

The radio antipodal number of a graph G is the smallest integer c such that there exists an assignment f : V (G) â†’ {1, 2, . . . , c} satisfying |f(u) âˆ’ f(v)| â‰¥ D âˆ’ d(u, v) for every two distinctâ€¦ (More)

- Sofiane Lagraa, Hamida Seba, Riadh Khennoufa, Abir M'Baya, Hamamache Kheddouci
- Pattern Recognition
- 2014

Graphs are universal modeling tools. They are used to represent objects and their relationships in almost all domains: they are used to represent DNA, images, videos, social networks, XML documents,â€¦ (More)

- Mustapha Kchikech, Riadh Khennoufa, Olivier Togni
- Electronic Notes in Discrete Mathematics
- 2005

Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interferenceâ€¦ (More)

- Riadh Khennoufa, Olivier Togni
- Ars Comb.
- 2011

A radio k-labeling of a connected graph G is an assignment f of non negative integers to the vertices of G such that |f(x)âˆ’ f(y)| â‰¥ k + 1âˆ’ d(x, y), for any two vertices x and y, where d(x, y) is theâ€¦ (More)

- Sofiane Lagraa, Hamida Seba, Riadh Khennoufa, Hamamache Kheddouci
- WEBIST
- 2011

Web service discovery is becoming a critical issue in several fields. The current approaches for service discovery and mainly semantic web services such as OWL-S are limited primarily to the matchingâ€¦ (More)

- Hamida Seba, Riadh Khennoufa
- Electronic Notes in Discrete Mathematics
- 2013

Edge-coloring total k-labeling of a connected graph G is an assignment f of non negative integers to the vertices and edges of G such that two adjacent edges e = uv and e = uv of G have differentâ€¦ (More)

- Riadh Khennoufa, Hamida Seba, Hamamache Kheddouci
- Inf. Process. Lett.
- 2013

- Riadh Khennoufa, Olivier Togni
- WALCOM
- 2008

This paper introduces a generalization of the graph bandwidth parameter: for a graph G and an integer k â‰¤ diam(G), the k-level bandwidth B(G) of G is defined by B(G) = minÎ³ max{|Î³(x)âˆ’Î³(y)|âˆ’d(x, y)+1â€¦ (More)

- Mustapha Kchikech, Riadh Khennoufa, Olivier Togni
- Discussiones Mathematicae Graph Theory
- 2008

- Mustapha Kchikech, Riadh Khennoufa, Olivier Togni
- Discussiones Mathematicae Graph Theory
- 2007

Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k â‰¥ 1, a linear radio k-labeling of G is an assignment f ofâ€¦ (More)