DM
2010
13 years 10 months ago
2010
DM
2010
13 years 11 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
DM
2010
13 years 11 months ago
2010
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
DM
2010
13 years 11 months ago
2010
A graph G is loosely-c-connected, or -c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite co...
DM
2010
13 years 11 months ago
2010
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...
DM
2010
13 years 11 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
Abstract. We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameteriz...
DM
2010
13 years 11 months ago
2010
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...
DM
2010
13 years 11 months ago
2010
We consider point-line geometries having three points on every line, having three lines through every point (bislim geometries), and containing triangles. We classify such geometr...