Interrelations of
Graph Theory, Combinatorial Designs, Theory of Error-Correcting Codes,
with a point of view from
Applied Algebra, Geometry and Topology.
Symmetry-search endeavor in algebraic and combinatorial structures,
including hypercubes, Cayley graphs
and other colored structures obtained via codes and designs,
finite fields and geometries.
At present, involved in geometric and combinatorial properties
of perfect error-correcting codes and related topics in
algebraic graph theory, combinatorial designs and domination in graphs.
The complete list of papers by Professor Dejter is available
here as a pdf-file.
(with C. Araujo) Lattice-like total perfect codes
, accepted for publication in Discussiones Mathematicae Graph Theory,
available here as pdf-file.
Worst-case efficient dominating sets in digraphs,
Discrete Applied Mathematics, 161 (2013) 944-952; First Online: DOI 10.1016/j.dam.2012.11.016,
available here as pdf-file.
On a $K_4$-UH self-dual 1-configuration $(102_4)_1$, preprint,
available here as pdf-file.
Pappus-Desargues digraph confrontation, to appear in JCMCC,
available here as pdf-file.
Great Circle Challenge and Odd Graphs
, preprint, available here as pdf-file.
On the structure of middle-levels graphs, preprint,
available here as pdf-file.
On $K_4$-ultrahomogeneous and related graphs based on pencils of binary projective spaces, preprint,
available here as pdf-file.
Asymptotic aspects of Cayley graphs, preprint,
available here as pdf-file.
(with K. T. Phelps)
On perfect domination of q-ary cubes
, preprint,
available here as
pdf-file.
The complete list of the papers of Professor Dejter is available
here as a pdf-file.
(with C. Araujo and P. Horak)
A Generalization of Lee Codes, Designs, Codes and Cryptography,
Online First, 2012, DOI: 10.1007/s10623-012-9666-6.
available here as pdf-file.
Orienting and separating distance-transitive graphs,
Ars Mathematica Contemporanea, 5 (2012) 221-236,
available here as pdf-file.
From the Coxeter graph to the
Klein graph, Journal of Graph Theory, 70 (2012), 1--9,
available here as pdf-file.
(with E. J. Billington, D. Hoffman and C. C. Lindner)
Almost resolvable maximum packings of complete
graphs with 4-cycles , Graphs and Combinatorics 27 (2011),
161-170,
available here as pdf-file.
Star graphs: threaded distance trees and E-sets
,
JCMCC, 77 (2011), 3-16,
available here as pdf-file,
On a $\vec{C}_4$-ultrahomogeneous
oriented graph,
Discrete Mathematics, 310 (2010) 1389-1391,
available here as pdf-file.
On a {K_4,K_{2,2,2}}-ultrahomogeneous graph
,
Australasian Journal of Combinatorics, 44(2009), 63-75.
preprint available here as pdf-file,
by courtesy of
http://ajc.maths.uq.edu.au.
(with A. A. Delgado)
Perfect domination in rectangular
grid graphs
, Jour. Combin. Math. Combin. Comput., 70 (2009) 177--196.
available here as pdf-file.
A larger version of this manuscript
is available here as here
Quasiperfect domination in triangular
lattices, Discussiones Mathematicae Graph Theory, 29(1) (2009), 179-198,
available here as pdf-file.
Perfect domination in regular grid graphs,
Australasian Journal of Combinatorics, 92 (2008), 99-114,
available here as pdf-file, by courtesy of
http://ajc.maths.uq.edu.au.
SQS-graphs of extended 1-perfect
codes, Congressus Numerantium, 193 (2008), 175-194,
available here as pdf-file.
A newer version of this publication,
SQS-graphs of Solov'eva-Phelps codes, can be found
in http://arxiv.org/PS_cache/arxiv/pdf/0905/0905.3178v1.pdf.
(with C. C. Lindner, C. A. Rodger and M. Meszka)
Almost resolvable 4-cycle systems
,
Jour. Combin. Math. Combin. Comput., 63 (2007), 173 - 182,
available here as pdf-file;
with a Corrigendum/Addendum in Jour. Combin. Math. Combin. Comput., 66 (2008), 297-298,
available here as
pdf-file, containing a kind contribution by
E. J. Billington, consisting in using the corrected Example 2.1, contributed by Dejter,
that provided an almost resolvable 4-cycle system of order n = 17, to construct
one of the missing cases, namely the one whose order is n = 33.
(Cases n = 41 and 57 are still not known).
(with A. A. Delgado)
Classes of Hamilton Cycles in the 5-Cube
, Jour. Combin. Math. Combin. Comput.,
61 (2007), 81-95, available here as pdf-file.
(NOTE: Reference [3]
at the end of this paper can be found in
http://home.coqui.net/dejterij/mcns/mirame.txt),
as the original site http://www.cnnet.edu became defunct.
(with A. A. Delgado)
STS-graphs of perfect codes mod kernel
, Discrete Mathematics 295 (2005), 31-47,
available here as pdf-file.
(with O. Serra)
Efficient dominating sets in Cayley graphs
, Discrete Applied Mathematics 129 (2003), 319-328, available here as
pdf-file.
(with K. T. Phelps)
Ternary Hamming and binary perfect covering codes
, in: A.
Barg and S. Litsyn, eds., Codes and Association Schemes,
DIMACS Ser. Disc. Math. Theor. Comp. Sci, 56, 2001, 111-113,
available here as
pdf-file.
Excluded minors for [2,3]-graph planarity,
JCMCC, 35 (2000), 117-125,
available here as pdf-file.
(with D. A. Pike and C. A. Rodger)
The directed almost resolvable Hamilton-Waterloo problem,
Australasian J. Combinat., 18 (1998), 201-208,
available here as pdf-file.
(with H. Hevia and O. Serra)
Hidden Cayley graph structures,
Discrete Math., 182 (1998), 69-83,
available here as pdf-file.
(with F. Franek, E. Mendelsohn and A. Rosa)
Triangles in 2-factorizations,
J. Graph Theory, 26 (1997), 83-94,
available here as pdf-file.
(with R. Giudici)
On Unitary Cayley graphs
, JCMCC 18 (1995) 121-124.
available here as
pdf-file.
Network models encoded by weighted tetrahedra, in Y. Alavi et al.
eds., Proc. 7th Int. Conf. Theory & Appl. Graphs, vol 1, 1995, 289-300,
available here as pdf-file.
(with V. Neumann-Lara)
Voltage graphs and Hamilton cycles
, Advances in Graph Theory,
V. R. Kulli ed., Vishwa Int. Publ., 1991, 141-153, available here as
pdf-file.
Totally multicolered subgraphs of complete
Cayley graphs, Congressus Num., 70 (1990), 53-64,
available here as pdf-file.
Minimal hamiltonian and nonhamiltonian
covering graphs of $K_n$, Ars Combinatoria, 25-C (1988), 63-71,
available here as pdf-file.
(with V. Neumann-Lara)
Unboundedness for generalized odd cyclic transversality
, Colloquia Mathematica Societatis J\'anos Bolyai, 52,
Combinatorics, Eger (Hungary), 1987, 195-203, available here as
pdf-file.
Unfolding m-genus tori around Cayley graphs, Ars Combinatoria, 25-C (1985), 125-133,
available here as pdf-file.
Hamilton cycles and quotients of bipartite graphs
, in Y. Alavi et al. (eds), Graph Theory & Appls.
Algor. & Comp. Sci., Wyley 1985, 189-199, available here as
pdf-file.
Equivalent conditions for Euler's problem on
$Z_4$-hamiltonian cycles, Ars Combinatoria, 16-B (1983), 285-295,
available here as pdf-file.
