New classes of set-sequential trees

DOI10.1016/J.DISC.2019.111741zbMATH Open1431.05133arXiv1710.02906OpenAlexW2995164039MaRDI QIDQ2286604FDOQ2286604

Authors: Louis Golowich, Chiheon Kim 

Publication date: 22 January 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: A graph is called set-sequential if its vertices can be labeled with distinct nonzero vectors in $mathbb{F}_2^n$ such that when each edge is labeled with the sum$pmod2$ of its vertices, every nonzero vector in $mathbb{F}_2^n$ is the label for either a single vertex or a single edge. We resolve certain cases of a conjecture of Balister, Gyori, and Schelp in order to show many new classes of trees to be set-sequential. We show that all caterpillars $T$ of diameter $k$ such that $kleq18$ or $|V(T)|geq{2}^{k-1}$ are set-sequential, where $T$ has only odd-degree vertices and $|T|=2^{n-1}$ for some positive integer $n$. We also present a new method of recursively constructing set-sequential trees.

Full work available at URL: https://arxiv.org/abs/1710.02906

Recommendations

• Set-valued graphs. II
• Further results on set-valued graphs
• Set-valued graphs
• On set labelings of graphs
• Some new results on set-graceful and set-sequential graphs

zbMATH Keywords

set-sequential graph theory

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• A note on ternary sequences of strings of 0 and 1
• Set colorings of graphs
• Title not available (Why is that?)
• Coloring vertices and edges of a graph by nonempty subsets of a set
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: New classes of set-sequential trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286604)