Charles Delorme

Affiliations:
  • University of Paris-Sud, Orsay, France


According to our database1, Charles Delorme authored at least 52 papers between 1980 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Weighted graphs: Eigenvalues and chromatic number.
Electron. J. Graph Theory Appl., 2016

2015
Quadratic Form Representations via Generalized Continuants.
J. Integer Seq., 2015

Continuants and Some Decompositions Into Squares.
Integers, 2015

2013
Edge-distance-regular graphs are distance-regular.
J. Comb. Theory A, 2013

Sequence of maximal distance codes in graphs or other metric spaces.
Electron. J. Graph Theory Appl., 2013

Cayley digraphs and graphs.
Eur. J. Comb., 2013

2012
Eigenvalues of complete multipartite graphs.
Discret. Math., 2012

2010
On Graphs with Cyclic Defect or Excess.
Electron. J. Comb., 2010

2009
On bipartite graphs of diameter 3 and defect 2.
J. Graph Theory, 2009

On Extremal Graphs with Bounded Girth.
Electron. Notes Discret. Math., 2009

On bipartite graphs of defect 2.
Eur. J. Comb., 2009

2008
Efficient edge domination in regular graphs.
Discret. Appl. Math., 2008

2007
Laplacian eigenvectors and eigenvalues and almost equitable partitions.
Eur. J. Comb., 2007

2004
Existence conditions for barycentric sequences.
Discret. Math., 2004

Barycentric sequences and barycentric Ramsey numbers stars.
Discret. Math., 2004

Laplacian eigenvalues and fixed size multisection.
Discret. Math., 2004

2003
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees.
Discret. Appl. Math., 2003

2002
Some New Large Compound Graphs.
Eur. J. Comb., 2002

On the Randic Image index.
Discret. Math., 2002

On the reconstruction of the degree sequence.
Discret. Math., 2002

Spectra and cuts.
Australas. J Comb., 2002

2001
Some remarks on Davenport constant.
Discret. Math., 2001

Presentations of groups generated by transpositions.
Discret. Math., 2001

2000
Laplacian Eigenvalues and multisections.
Electron. Notes Discret. Math., 2000

1999
Multidiameters and Multiplicities.
Eur. J. Comb., 1999

1998
Optimal Schedules for d-D Grid Graphs with Communication Delays.
Parallel Comput., 1998

Tools for studying paths and cycles in digraphs.
Networks, 1998

The Spectrum of de Bruijn and Kautz Graphs.
Eur. J. Comb., 1998

1997
Eigenvalues, eigenspaces and distances to subsets.
Discret. Math., 1997

1996
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract).
Proceedings of the STACS 96, 1996

Rubik Routing Permutations on Graphs.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
Edge Deletion Preserving the Diameter of the Hypercube.
Discret. Appl. Math., 1995

1994
On products of sets in groups.
Graphs Comb., 1994

Distance Biregular Bipartite Graphs.
Eur. J. Comb., 1994

1993
Laplacian eigenvalues and the maximum cut problem.
Math. Program., 1993

Combinatorial Properties and the Complexity of a Max-cut Approximation .
Eur. J. Comb., 1993

The performance of an eigenvalue bound on the max-cut problem in some classes of graphs.
Discret. Math., 1993

Eigenvalues of finite graphs.
Discret. Math., 1993

A note on partial Cayley graphs.
Discret. Math., 1993

1992
Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups.
Eur. J. Comb., 1992

Examples of Products Giving Large Graphs with Given Degree and Diameter.
Discret. Appl. Math., 1992

Table of Large (<i>Delta, D</i>)-Graphs.
Discret. Appl. Math., 1992

1991
Diameter, Covering Index, Covering Radius and Eigenvalues.
Eur. J. Comb., 1991

1986
Strategies for Interconnection Networks: Some Methods from Graph Theory.
J. Parallel Distributed Comput., 1986

1985
Large bipartite graphs with given degree and diameter.
J. Graph Theory, 1985

Grands Graphes de Degré et Diamètre Donnés.
Eur. J. Comb., 1985

1984
Large Graphs with Given Degree and Diameter - Part I.
IEEE Trans. Computers, 1984

Large graphs with given degree and diameter. II.
J. Comb. Theory B, 1984

Infinite generalized friendship graphs.
Discret. Math., 1984

1982
Tables of Large Graphs with Given Degree and Diameter.
Inf. Process. Lett., 1982

1980
Cycles with a chord are graceful.
J. Graph Theory, 1980

Two sets of graceful graphs.
J. Graph Theory, 1980


  Loading...