Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1711.03096

L(t, 1)-Colouring of Graphs

Priyanka Pandey·Joseph Varghese Kureethara
View original source ↗Read source document ↗Export metadata ↓

Abstract

One of the most famous applications of Graph Theory is in the field of Channel Assignment Problems. There are varieties of graph colouring concepts that are used for different requirements of frequency assignments in communication channels. We introduce here L(t, 1)-colouring of graphs. This has its foundation in T-colouring and L(p, q)-colouring. For a given finite set T including zero, an L(t, 1)-colouring of a graph G is an assignment of non-negative integers to the vertices of G such that the difference between the colours of adjacent vertices must not belong to the set T and the colours of vertices that are at distance two must be distinct. The variable t in L(t, 1) denotes the elements of the set T. For a graph G, the L(t, 1)-span of G is the minimum of the highest colour used to colour the vertices of a graph out of all the possible L(t, 1)-colourings. It is denoted by $λ_{t,1} (G)$. We study some properties of L(t, 1)-colouring. We also find upper bounds of $λ_{t,1} (G)$ of selected simple connected graphs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Priyanka Pandey, Joseph Varghese Kureethara. 2018-04-25. L(t, 1)-Colouring of Graphs. https://arxiv.org/abs/1711.03096

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗