Total difference chromatic numbers of graphs

Rohatgi, Ranjan; Zhang, Yufei

doi:10.2140/involve.2020.13.511

Download this article
	For screen
	For printing

Recent Issues

The Journal

About the journal

Ethics and policies

Peer-review process

Submission guidelines

ISSN 1944-4184 (online)

ISSN 1944-4176 (print)

Author index

To appear

Other MSP journals

This article is available for purchase or by subscription. See below.

Total difference chromatic numbers of graphs

Ranjan Rohatgi and Yufei Zhang

Vol. 13 (2020), No. 3, 511–528

DOI: 10.2140/involve.2020.13.511

Abstract

Inspired by graceful labelings and total labelings of graphs, we introduce the idea of total difference labelings. A $k$ -total labeling of a graph $G$ is an assignment of $k$ distinct labels to the edges and vertices of a graph so that adjacent vertices, incident edges, and an edge and its incident vertices receive different labels. A $k$ -total difference labeling of a graph $G$ is a function $f$ from the set of edges and vertices of $G$ to the set ${1, 2, \dots, k}$ that is a $k$ -total labeling of $G$ and for which $f ({u, v}) = | f (u) - f (v) |$ for any two adjacent vertices $u$ and $v$ of $G$ with incident edge ${u, v}$ . The least positive integer $k$ for which $G$ has a $k$ -total difference labeling is its total difference chromatic number, $χ_{td} (G)$ . We determine the total difference chromatic number of paths, cycles, stars, wheels, gears and helms. We also provide bounds for total difference chromatic numbers of caterpillars, lobsters, and general trees.

PDF Access Denied

We have not been able to recognize your IP address 18.97.14.85 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 30.00:

Keywords

graph labelings, graceful graphs, total colorings

Mathematical Subject Classification 2010

Primary: 05C15, 05C78

Milestones

Received: 23 December 2019

Revised: 12 March 2020

Accepted: 28 April 2020

Published: 14 July 2020

Communicated by Joseph A. Gallian

Authors

Ranjan Rohatgi
Department of Mathematics and Computer Science Saint Mary’s College Notre Dame, IN United States

Yufei Zhang
Department of Mathematics and Computer Science Saint Mary’s College Notre Dame, IN United States

Vol. 13, No. 3, 2020