5 research outputs found
Sequence variations of the 1-2-3 Conjecture and irregularity strength
Karonski, Luczak, and Thomason (2004) conjectured that, for any connected
graph G on at least three vertices, there exists an edge weighting from {1,2,3}
such that adjacent vertices receive different sums of incident edge weights.
Bartnicki, Grytczuk, and Niwcyk (2009) made a stronger conjecture, that each
edge's weight may be chosen from an arbitrary list of size 3 rather than
{1,2,3}. We examine a variation of these conjectures, where each vertex is
coloured with a sequence of edge weights. Such a colouring relies on an
ordering of the graph's edges, and so two variations arise -- one where we may
choose any ordering of the edges and one where the ordering is fixed. In the
former case, we bound the list size required for any graph. In the latter, we
obtain a bound on list sizes for graphs with sufficiently large minimum degree.
We also extend our methods to a list variation of irregularity strength, where
each vertex receives a distinct sequence of edge weights.Comment: Accepted to Discrete Mathematics and Theoretical Computer Scienc
Labeling of graphs, sumset of squares of units modulo n and resonance varieties of matroids
This thesis investigates problems in a number of different areas of graph theory and its applications in other areas of mathematics. Motivated by the 1-2-3-Conjecture, we consider the closed distinguishing number of a graph G, denoted by dis[G]. We provide new upper bounds for dis[G] by using the Combinatorial Nullstellensatz. We prove that it is NP-complete to decide for a given planar subcubic graph G, whether dis[G] = 2. We show that for each integer t there is a bipartite graph G such that dis[G] \u3e t. Then some polynomial time algorithms and NP-hardness results for the problem of partitioning the edges of a graph into regular and/or locally irregular subgraphs are presented. We then move on to consider Johnson graphs to find resonance varieties of some classes of sparse paving matroids. The last application we consider is in number theory, where we find the number of solutions of the equation x21 + _ _ _ + x2 k = c, where c 2 Zn, and xi are all units in the ring Zn. Our approach is combinatorial using spectral graph theory