Charles Delorme

Publication Activity (10 Years)

Years Active: 1980-2016
Publications (10 Years): 3

Top Topics

Nearest Neighbor Queries

Top Venues

Electron. J. Graph Theory Appl.

J. Comb. Theory, Ser. A

J. Integer Seq.

Publications

Charles Delorme
Weighted graphs: Eigenvalues and chromatic number. Electron. J. Graph Theory Appl. 4 (1) (2016)
Charles Delorme, Guillermo Pineda-Villavicencio
Quadratic Form Representations via Generalized Continuants. J. Integer Seq. 18 (6) (2015)
Charles Delorme, Guillermo Pineda-Villavicencio
Continuants and Some Decompositions Into Squares. Integers 15 (2015)
Marc Cámara, Cristina Dalfó, Charles Delorme, Miguel Angel Fiol, H. Suzuki
Edge-distance-regular graphs are distance-regular. J. Comb. Theory, Ser. A 120 (5) (2013)
Charles Delorme
Cayley digraphs and graphs. Eur. J. Comb. 34 (8) (2013)
Charles Delorme
Sequence of maximal distance codes in graphs or other metric spaces. Electron. J. Graph Theory Appl. 1 (2) (2013)
Charles Delorme
Eigenvalues of complete multipartite graphs. Discret. Math. 312 (17) (2012)
Charles Delorme, Guillermo Pineda-Villavicencio
On Graphs with Cyclic Defect or Excess. Electron. J. Comb. 17 (1) (2010)
Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio
On bipartite graphs of diameter 3 and defect 2. J. Graph Theory 61 (4) (2009)
Charles Delorme, Evelyne Flandrin, Yuqing Lin, Mirka Miller, Joe Ryan
On Extremal Graphs with Bounded Girth. Electron. Notes Discret. Math. 34 (2009)
Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio
On bipartite graphs of defect 2. Eur. J. Comb. 30 (4) (2009)
Domingos Moreira Cardoso, J. Orestes Cerdeira, Charles Delorme, Pedro C. Silva
Efficient edge domination in regular graphs. Discret. Appl. Math. 156 (15) (2008)
Domingos Moreira Cardoso, Charles Delorme, Paula Rama
Laplacian eigenvectors and eigenvalues and almost equitable partitions. Eur. J. Comb. 28 (3) (2007)
Charles Delorme
Laplacian eigenvalues and fixed size multisection. Discret. Math. 276 (1-3) (2004)
Charles Delorme, Isabel Marquez, Oscar Ordaz, Asdrubal Ortuño
Existence conditions for barycentric sequences. Discret. Math. 281 (1-3) (2004)
Charles Delorme, Samuel Gonzalez, Oscar Ordaz, María Teresa Varela
Barycentric sequences and barycentric Ramsey numbers stars. Discret. Math. 277 (1-3) (2004)
Charles Delorme, Odile Favaron, Dieter Rautenbach
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. Discret. Appl. Math. 130 (3) (2003)
Charles Delorme, J. Gómez
Some New Large Compound Graphs. Eur. J. Comb. 23 (5) (2002)
Charles Delorme, Odile Favaron, Dieter Rautenbach
On the reconstruction of the degree sequence. Discret. Math. 259 (1-3) (2002)
Charles Delorme
Spectra and cuts. Australas. J Comb. 26 (2002)
Charles Delorme, Odile Favaron, Dieter Rautenbach
On the Randic Image index. Discret. Math. 257 (1) (2002)
Charles Delorme, Oscar Ordaz, Domingo Quiroz
Some remarks on Davenport constant. Discret. Math. 237 (1-3) (2001)
Charles Delorme
Presentations of groups generated by transpositions. Discret. Math. 236 (1-3) (2001)
Charles Delorme
Laplacian Eigenvalues and multisections. Electron. Notes Discret. Math. 5 (2000)
Fan R. K. Chung, Charles Delorme, Patrick Solé
Multidiameters and Multiplicities. Eur. J. Comb. 20 (7) (1999)
Evripidis Bampis, Charles Delorme, Jean-Claude König
Optimal Schedules for d-D Grid Graphs with Communication Delays. Parallel Comput. 24 (11) (1998)
Charles Delorme, Oscar Ordaz, Domingo Quiroz
Tools for studying paths and cycles in digraphs. Networks 31 (2) (1998)
Charles Delorme, Jean-Pierre Tillich
The Spectrum of de Bruijn and Kautz Graphs. Eur. J. Comb. 19 (3) (1998)
Charles Delorme, Jean-Pierre Tillich
Eigenvalues, eigenspaces and distances to subsets. Discret. Math. (1997)
Charles Delorme, Petrisor Panaite
Rubik Routing Permutations on Graphs. Euro-Par, Vol. I (1996)
Evripidis Bampis, Charles Delorme, Jean-Claude König
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). STACS (1996)
Abdelmadjid Bouabdallah, Charles Delorme, Selma Djelloul
Edge Deletion Preserving the Diameter of the Hypercube. Discret. Appl. Math. 63 (1) (1995)
Charles Delorme, Yahya Ould Hamidoune
On products of sets in groups. Graphs Comb. 10 (2-4) (1994)
Charles Delorme
Distance Biregular Bipartite Graphs. Eur. J. Comb. 15 (3) (1994)
J. Bond, Charles Delorme
A note on partial Cayley graphs. Discret. Math. 114 (1-3) (1993)
Charles Delorme, Svatopluk Poljak
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Discret. Math. 111 (1-3) (1993)
Charles Delorme
Eigenvalues of finite graphs. Discret. Math. 114 (1-3) (1993)
Charles Delorme, Svatopluk Poljak
Combinatorial Properties and the Complexity of a Max-cut Approximation . Eur. J. Comb. 14 (4) (1993)
Charles Delorme, Svatopluk Poljak
Laplacian eigenvalues and the maximum cut problem. Math. Program. 62 (1993)
Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater
)-Graphs. Discret. Appl. Math. (1992)
Charles Delorme, Odile Favaron, Maryvonne Mahéo
Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups. Eur. J. Comb. 13 (1) (1992)
Charles Delorme
Examples of Products Giving Large Graphs with Given Degree and Diameter. Discret. Appl. Math. (1992)
Charles Delorme, Patrick Solé
Diameter, Covering Index, Covering Radius and Eigenvalues. Eur. J. Comb. 12 (2) (1991)
Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater
Strategies for Interconnection Networks: Some Methods from Graph Theory. J. Parallel Distributed Comput. 3 (4) (1986)
Charles Delorme
Grands Graphes de Degré et Diamètre Donnés. Eur. J. Comb. 6 (4) (1985)
Charles Delorme
Large bipartite graphs with given degree and diameter. J. Graph Theory 9 (3) (1985)
Charles Delorme, G. Farhi
Large Graphs with Given Degree and Diameter - Part I. IEEE Trans. Computers 33 (9) (1984)
Charles Delorme, Gena Hahn
Infinite generalized friendship graphs. Discret. Math. 49 (3) (1984)
Jean-Claude Bermond, Charles Delorme, G. Farhi
Large graphs with given degree and diameter. II. J. Comb. Theory, Ser. B 36 (1) (1984)
Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater
Tables of Large Graphs with Given Degree and Diameter. Inf. Process. Lett. 15 (1) (1982)
Charles Delorme
Two sets of graceful graphs. J. Graph Theory 4 (2) (1980)
Charles Delorme, Maryvonne Mahéo, Henri Thuillier, Khee Meng Koh, H. K. Teo
Cycles with a chord are graceful. J. Graph Theory 4 (4) (1980)