Sciweavers

EJC
2008
13 years 11 months ago
Multiple Kronecker covering graphs
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon and apply it to show that the minimal common cover of two graphs need not be uniqu...
Wilfried Imrich, Tomaz Pisanski
EJC
2008
13 years 11 months ago
Explicit constructions of loops with commuting inner mappings
In 2004, Cs
Ales Drápal, Petr Vojtechovský
EJC
2008
13 years 11 months ago
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
Let be a triangle-free distance-regular graph with diameter d 3, valency k 3 and intersection number a2 = 0. Assume has an eigenvalue with multiplicity k. We show that if for ...
Kris Coolsaet, Aleksandar Jurisic, Jack H. Koolen
EJC
2008
13 years 11 months ago
Grad and classes with bounded expansion I. Decompositions
Abstract. We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new ...
Jaroslav Nesetril, Patrice Ossona de Mendez
EJC
2008
13 years 11 months ago
On two-path convexity in multipartite tournaments
Darren B. Parker, Randy F. Westhoff, Marty J. Wolf
EJC
2008
13 years 11 months ago
Pooling spaces associated with finite geometry
3 Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing 4 algorithms with applications to DNA library screening, DIMACS Series in Discrete Ma...
Tayuan Huang, Kaishun Wang, Chih-wen Weng
EJC
2008
13 years 11 months ago
Pattern classes of permutations via bijections between linearly ordered sets
Abstract. A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which...
Sophie Huczynska, Nikola Ruskuc
EJC
2008
13 years 11 months ago
The Ramsey numbers for stars of even order versus a wheel of order nine
For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or the complement of G co...
Yunqing Zhang, Yaojun Chen, Kemin Zhang
EJC
2008
13 years 11 months ago
Factorization formulas for MacDonald polynomials
The aim of this note is to give some factorisation formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing...
François Descouens, Hideaki Morita