Josef Lauri
Research
About
My Stuff
Links
Research
Book
Home
>
Research
(With M.Klin and Matan Ziv-Av)
Links between two semisymmetric graphs on 112 vertices via association schemes.
J. Symbolic Comput.
47(10) (2012) 1175-1191.
(With M.Klin and Matan Ziv-Av)
Links between two semisymmetric graphs on 112 vertices through the lens of association schemes.
(Long Version -- REVISED December 2012)
(With K.J. Asciak)
On the edge-reconstruction numbers of disconnected graphs.
Bull. Inst. Combin. A
ppl. 63 (2011) 87-100.
Subgraphs as a measure of similarity.
In, M. Dehmer (Ed.) Structural Analysis of Complex Networks (Birkhauser) 2011.
(With C.J. Tjhai)
Coset graphs for LDPC codes.
IET Commun. 5(5) (2011) 719-727.
(With R Scapellato & R Mizzi)
Two-fold automorphisms of graphs.
Australas. J. Combin.
49
(2011) 165-176.
Link
to journal.
(With K.J. Asciak, M.A. Francalanza and W. Myrvold)
A survey on some open questions in reconstruction numbers.
Ars Combin.
97
(2010) 443-456.
(With R. Mizzi and R. Scapellato)
Two-fold orbital-digraphs and other constructions.
Intern. J. of Pure & Applied Maths
1
(2004) 63-93
Constructing graphs with several pseudosimilar vertices or edges.
Combinatorics 2000 (Gaeta).
Discrete Math.
267
(2003) 197-211.
(With K.J. Asiack)
On disconnected graphs with large reconstruction numbers.
Ars Combin.
62
(2002) 173-181.
Cayley graphs, pseudosimilar edges and line-graphs.
J. Combin. Math. Combin. Comput.
32
(2000) 149-159.
On a formula for the number of Euler trails for a class of digraphs.
Discrete Math.
163(1-3)
(1997) 307-312.
Slides
of a talk on two-fold orbital graphs given in Catania, 2004.
Last Updated: 14 December 2013
Staff Web Page
Disclaimer: The opinions and statements expressed above do not necessarily reflect the view of the University of Malta.